Q. In a binary tree, certain null entries are re-placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called (Solved)
1. Leaf
2. Branch
3. Path
4. Thread
- d. Thread
1. Leaf
2. Branch
3. Path
4. Thread