Perform boundary trversal on a given binary tree.
Given a linked list, reverse the direction of nodes in the list.
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 binary tree, print the cousins of the given node.
Given a stream of integers, find the largest K integers.