Question

How many key comparisons are required during a search from the root node to find whether the key "8" is stored in the binary search tree constructed from the following sequence of insertion:

17,7,11,9,22,3,8,35,16,6

Answer 1

The tree will look like this:

So there are 4 competencies to find 8 in this tree.