A binary search tree (BST), representing a set data structure, exhibits its wors

Question

A binary search tree (BST), representing a set data structure, exhibits its worst case behavior (i.e., highest computational cost) for finding, inserting and removing a target values when (a) The values stored in the set have been inserted in ascending or descending order of magnitude. (b) The values stored in the set have been inserted in some random order. (c) The values stored have been inserted so that the largest value has been added first, and the smallest last. (d) The order in which values have been inserted into the set's underlying BST has no effect on the efficiency of the set operations.

Explanation / Answer

Solution:

For worst case behaviour of BST if The values stored in the set have been inserted in ascending and descending order of magnitude then what will happen is our BST will become skewed tree whether left skewed or right skewed which is worst case scenario and in this case it will take O(n) time to search, insert and delete any element in BST to solve this problem balanced binary tree named as AVL tree was introduced. So aoption is true.

I hope this helps. :)

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.