Interview Questions on Binary Search tree

• Given a binary tree,create the copy of the tree.
• Given a binary tree, count the number of nodes in the tree.
• Given a binary tree, find the maximum depth the number of nodes along the longest path from the root node down to the farthest leaf node.
• Write a code to find the minimum and maximum value in binary search tree
• Print the BST in increasing order…to put this in different way, it simply means to print in inorder traversal
• Print the post order traversal (recursive)
• Print the paths in binary search tree from root to leaves.
• Get the mirror of Binary tree
• BST : Binary search tree with double tree
• BT: How to check whether 2 trees are same or not?
• BST: How to check whether 2 trees are BST or NOT
• BST:Return Nth Node in in-order traversal
• Construct a tree given its inorder and preorder
• Given an expression tree, calculate the expression
• Write a code to write DFS and BFS on tree.