Question 1-1
Suppose we use a skew binary tree representation for a list.
When the list contains the data [10,20,30,...,100], its internal
structure is as follows.
Draw the list's internal structure after each of the
following insertions, in sequence.
- a. 110
- b. 120
- c. 130
- d. 140
- e. 150
Solution
Back to Exam Review 1