Question: A binary search tree has the property that for every node in the tree a . the depth of a node in a tree is
A binary search tree has the property that for every node in the tree
a
the depth of a node in a tree is the length of the path from the root to the node
b
the value contained in a node can only be a primitive data type
c
the value of any node in its right subtree is greater than the value of the node
d
the value of any node in its left subtree is less than the value of the node
e
can be represented using a set of linked nodes
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
