If each node in a tree has value greater than every value in its left sub tree and value less than every value in its right sub tree, the tree is known as
A. Complete
tree
B. Full binary
tree
C. Binary
search tree
D. Threaded tree
No comments:
Post a Comment