Question: multiple answers allowed Question 8 Given an array of size n, which of the followings about AVL tree and BST sort are correct? BST sort

multiple answers allowed
Question 8 Given an array of size n, which of the followings about AVL tree and BST sort are correct? BST sort has the same comparisons/partitions as quicksort, but in a different order Insertion in an AVL tree may require more than one (single/double) rotation, while it still guarantees runtime of O (log n) in any case Deletion in an AVL tree may require 0 (log n) rotations, while it still guarantees runtime of O (log n) in any case Sorting with any BST guarantees runtime of O (n log n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
