Question

if we draw a binary search tree by inserting the given numbers from left to right theen what would be the height of bst? 112,67,455,672,234,115​

Answer 1

Explanation:

• A binary tree is a tree-type non-linear data structure with no more than two offspring per parent.
• Every node in a binary tree has a left and right reference in addition to the data element.
• The root node is the most important node in a tree structure.

Answer 2

Answer:

4

Explanation:

will the answer of this question