Which of the following is false about a binary search tree?
|A.||The left child is always lesser than its parent|
|B.||The right child is always greater than its parent|
|C.||The left and right sub-trees should also be binary search trees|
|D.||In order sequence gives decreasing order of elements|
|Answer» D. In order sequence gives decreasing order of elements|
Login to Continue
It will take less than 2 minutes