4.15 Additional Exercises |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Exercises:
1. Sentinels were a main theme of the chapter before this one. Figure out how to apply sentinel techniques to binary search trees. Write routines for search and insertion in such a binary search tree with sentinel. Test your functions. (You need not make your code fully generic; e.g., it is acceptable to “hard-code” the data type stored in the tree.) [answer]
![]() |
![]() |
5 AVL Trees
![]() |