Tuesday, 28 August 2012

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 | Data Structures

A. Leaf
B. branch
C. path
D. thread

Ans: D


No comments: