How many NULL pointers are there in a standard Binary Tree with 10 nodes?
Formula: A binary tree with N nodes has total 2N child pointers. N - 1 pointers connect to child nodes. Thus NULL pointers = 2N - (N - 1) = N + 1 = 10 + 1 = 11.
In Python, what is the dynamic resizing strategy of lists when capacity is exceeded?
Python list implementation (listobject.c) uses new_allocated = (newsize >> 3) + (newsize < 9 ? 3 : 6) + newsize to balance memory usage and O(1) amortized growth.
Consider inserting elements into a Min-Heap: 10, 5, 20, 2. What element is at the root of the Min-Heap?
A Min-Heap maintains the minimum element at the root position. Minimum of {10, 5, 20, 2} is 2.
Which data structure is most efficient for implementing a Priority Queue?
A Binary Heap allows O(log N) insertion and O(log N) deletion of the highest/lowest priority element, making it optimal for Priority Queues.
Which of the following statements regarding Hash Tables and Collisions is/are CORRECT?
Chaining allows load factor > 1. Open addressing stores items directly in table slots, so $\alpha <= 1$. Linear probing suffers from primary clustering. Hash table lookup is O(N) worst-case (when all keys collide).