Multiple choice technology architecture

In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called

  1. Leaf

  2. branch

  3. path

  4. thread
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

In a threaded binary tree, null pointers are replaced with 'threads' that point to predecessor or successor nodes in the in-order traversal sequence. This allows efficient traversal without recursion or a stack. Option A (leaf) is a node with no children. Option B (branch) is not standard terminology. Option C (path) refers to a sequence of nodes.

Keep practicing — related questions