Given a binary tree, calculate the height of the tree
Perform boundary trversal on a given binary tree.
Perform breadth first seach on a given binary tree.
Perform depth first seach on a given binary tree.
Delete a node from BST (Binary Search Tree) such that the resultant tree is also a BST.
Given a linked list, check if it has a loop. If yes, remove the loop.
Given a binary tree, connect the sibling nodes at each level.
Given pre-order & in-order traversal of a binary tree, construct the tree.
Given a sorted array of integers rotated k times, check if given key is present in it?