Vidyalelo
Data Structure · Q41

Binary Search Trees(B Tree)

Programming · Data Structure · question 41

Q41

In a Binary Search Tree (BST), how can you find the depth of a particular node?

A.
By counting the number of edges from the root to the node.
Answer
B.
By counting the number of nodes in the subtree.
C.
By finding the height of the tree.
D.
By counting the number of children of the node.

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board