If we have drawn a binary search tree by inserting given values 91,82,54,32
Answers
Answered by
0
Answer & Explanation:
In a binary search tree (BST), each node contains:
- Only smaller values in its left sub tree
- Only larger values in its right sub tree
When elements are given in a sequence:
- Always consider the first element as the root node.
- Consider the given elements and insert them in the BST one by one.
The binary search tree will be constructed as explained below-
Attachments:
Similar questions