edited by
1,135 views

1 Answer

1 votes
1 votes
In the worst case a binary tree can be either

1. Right Skewed, or

2. Left Skewed.

in either case, the tree is a straight line or TOSET like structure.

Thus making the height equal to the number of nodes in the tree i.e. O(n). Hence, B is the correct option.

Also making the search sequential with O(n) running time.

To mitigate this problem AVL Tree uses the concept of BALANCE FACTOR. Therefore AVL Tree guarantees O(log n) search time.

Related questions

1 votes
1 votes
2 answers
1
1 votes
1 votes
1 answer
2
go_editor asked Mar 28, 2020
862 views
Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i $0$) of the tree ? Assume that the root is at l...
0 votes
0 votes
1 answer
3
go_editor asked Mar 28, 2020
1,699 views
Which of the following data structure is used to implement recursion ?ArraysStacksQueuesLinked lists
2 votes
2 votes
1 answer
4