Consider the following tree diagrams: Which are binary search trees?
A)Neither I nor II
B)I only
C)Both I and II
D)II only

Question

Consider the following tree diagrams:  Which are binary search trees? 
A)Neither I nor II 
B)I only 
C)Both I and II 
D)II only

Quizplus · Accepted Answer

A binary search tree is a binary tree where the left subtree of each node contains only nodes with keys lesser than the node’s key and right subtree of each node contains only nodes with keys greater than the node’s key. 
In Tree I, the left subtree of the node with key 8 contains a node with key greater than 8 (10), so it is not a binary search tree. 
In Tree II, each node satisfies the above condition, so it is a binary search tree.

Consider the Following Tree Diagrams: Which Are Binary Search