01What is the strict ordering rule for a Binary Search Tree (BST)?
02What is a 'Perfect Binary Tree'?
03In a complete binary tree stored in an array at index `i`, what is the index of the right child?
04When deleting a node with two children from a BST, it is typically replaced by its:
05What is the height of a tree with only a root node?
06A 'Full' binary tree is one where:
07What is the complexity of searching in a 'Degenerate' (linked-list-like) BST?
08Which data structure is used to implement a Binary Heap?
09An AVL tree is a type of:
10What is the leaf node index range for a heap of size N?