In a complete binary tree, the parent of any node k can be determined by ________.

Consider a linked list of n elements which is pointed by an external pointer. What is the time taken to delete the element which is a successor of the pointed element by a given pointer?

Suppose X is a B-tree leaf containing 41 entries and has at least one sibling. Which of the statements would be true in this case?

In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the path counts 1. Assume log(n) is log base 2.