Q1: Given a complete binary tree, and the rank/index. Determine whether the rank/index is present in the Tree or not.

Rank was assigned using the level order traversal of the tree. Rank starts with 1 from root node.

Q2: Given a BST, replace the value of each node to sum of all the values which have the value greater than the current node.

Q3: Delete a node with a given pointer from the single linked list, the only catch is that head to the linked list is not given.