QUESTION 1
(a) Creating a binary search tree with a sorted list of values
results in a linear linked list. Explain why this cannot happen
with an avl tree.
(b) Create an avl tree by inserting the numbers
in order 8,12,9.
(c) Using the tree created in part (b) insert the
following numbers 4, 7, 3, 1. For full marks you must show the
construction of the tree at each stage.
QUESTION 1 (a) Creating a binary search tree with a sorted list of values results in a linear linked list. Explain why t
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
QUESTION 1 (a) Creating a binary search tree with a sorted list of values results in a linear linked list. Explain why t
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!