What property does a Binary Search Tree (BST) ensure for its...

Home / Data Structure / Binary Search Trees(B Tree) / Question

Examveda

What property does a Binary Search Tree (BST) ensure for its left and right subtrees?

A. The left subtree contains nodes with values less than the root, and the right subtree contains nodes with values greater than the root.

B. The left subtree contains nodes with values greater than the root, and the right subtree contains nodes with values less than the root.

C. Both subtrees have equal values.

D. The left subtree is always empty.

Answer: Option A

Related Questions on Binary Search Trees(B Tree)

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

View Answer

A. Inorder

B. Preorder

C. Postorder

D. Level-order

View Answer

A. 1

B. 2

C. 3

D. Any number

View Answer

A. Verify if all nodes in the left subtree are less than the root and all nodes in the right subtree are greater than the root.

B. Check if the tree is balanced.

C. Ensure all nodes have exactly two children.

D. Verify the height of the tree.

View Answer