If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called
A. AVL tree
B. Complete tree
C. Full binary tree
D. Binary search tree
Answer:B
If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called
A. AVL tree B. Complete tree C. Full binary tree D. Binary search tree