Write a predicate second(X,List) which checks if X is the second element
of List.
Write a Prolog program which computes the fibonacci numbers.
Write a (Prolog) program which takes in input two ordered lists of integers
and returns an ordered list of integers containing all elements in the
original lists.
Write a (Prolog) program that taken one list L of integers and one integer
value N, divides the elements of L in two lists L1 and L2 such that all elements less or equal than N are in L1 and in L2 all the others.
Write a program which given a list of integers L returns an ordered list
of integers containing the elements in L.
Write a program which given one list L of integers and an integer value N
decides if X belongs to L.
Write a program which given two lists L1 and L2 of integers decides if all elements in the first list are present in the second one.
=======More difficult
find a representation for binary trees.
Then write a program to look for a value N inside a binary search tree.