Second (and last) block of exercises of Prolog for Logic Programming
Given a binary tree, print its nodes level by level. i.e. all nodes present at level 1 should be printed first followed by nodes of level 2 and so on. All nodes for any level should be printed from left to right.
*Inputs:
*Output:
Given a binary tree, write an efficient algorithm o convert binary tree to its mirror.
*Inputs:
*Output: