[Solved] Which of the following is false about a binary search tree?

Computer Science Engineering (CSE)
Data Structures (DS)
Non Linear Data Structures - Trees
Which of the following is false about a ...

Q.	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

View all MCQs in: Data Structures (DS)

Discussion

Related Questions

Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
A binary tree of depth "d" is an almost complete binary tree if __________.
Which of the following pair’s traversals on a binary tree can build the tree uniquely?
The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
In a binary search tree, which of the following traversals would print the numbers in the ascending order?
Which of the following is not the self balancing binary search tree?