Question: Binary search trees (BSTs) and AVL trees are concepts from the advanced data structures course. What is true about these 2 data structures? Every BST
Binary search trees (BSTs) and AVL trees are concepts from the advanced data structures course. What is true about these 2 data structures?
| Every BST is also an AVL tree. AVL trees have a better worst case space complexity when compared with a BST representing the same data. | ||
| Every AVL tree is a BST. AVL trees have a better worst case time complexity for add and remove operations when compare with a BST representing the same data. | ||
| A BST is balanced AVL tree. | ||
| BSTs and AVL trees are both trees, but they have no other relation to each other and one is not an extension of the other. |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
