This repository contains solutions of some simple problems written in Prolog.
- Calculate X to the power of N, for N>0. (
- Calculate N factorial, for N>0. (
- Calculate N-th Fibonacci number, for N>=0. (
- Check if structure is a binary tree. (
- Sum all node values of a binary tree. (
Copyright 2017 Vladimir Jovanovic Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.