Consider inserting key k into a hash table of size m using quadratic probing h(k, i) = (h'(k) + c1*i + c2*i^2) % m. What is the primary purpose of quadratic probing over linear probing?
Quadratic probing spreads out probe sequences non-linearly, thereby eliminating the Primary Clustering phenomenon seen in linear probing.
A Full Binary Tree has 7 internal nodes. How many leaf nodes does it contain?
In any Full Binary Tree (where every node has 0 or 2 children), Number of Leaves (L) = Number of Internal Nodes (I) + 1 = 7 + 1 = 8.
Which traversal of a Binary Tree processes nodes level by level from top to bottom, left to right?
Level Order traversal visits nodes level-by-level using a Queue data structure.
Calculate the height of a Complete Binary Tree containing 10 nodes (where a single root node has height 0):
height = floor(log2(N)) = floor(log2(10)) = floor(3.32) = 3.
In a Doubly Linked List, how many pointer fields does each node contain?
Each node in a doubly linked list contains data plus two pointers: prev (points to prior node) and next (points to subsequent node).