» Unlabelled » A binary tree whose every node has either zero or two children is called | Data Structures

Tuesday, 28 August 2012

A binary tree whose every node has either zero or two children is called | Data Structures

A. Complete binary tree
B. Binary search tree
C. Extended binary tree
D. None of above

Ans:  C


at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)