Trees

1
How do you convert the inorder traversal of a binary tree into a circularly doubly link list.



2
Given a binary tree , print all of its root to leaf paths.



3
Check whether given binary tree is BST or not.



4
How will you efficiently store a binary tree to a persistent file for later retrieval.



5
How can we traverse a binary tree without using more than constant memory.