In a binary search tree,if a node has two children,then how many key values does the node itself contain?
A)none
B)one
C)two
D)the number may vary

Question

Quizplus · Accepted Answer

In a binary search tree, each node can have at most one key value. If a node has two children, then those children would be the left and right subtrees of the node, each with their own root key value. Therefore, the node itself contains only one key value, which is the root value of the left subtree or the right subtree.

In a Binary Search Tree,if a Node Has Two Children,then