Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.
- Create BookmarkCreate Bookmark
- Create Note or TagCreate Note or Tag
- DownloadDownload
- PrintPrint
Chapter 10. Binary Search Trees > Exercises
10.5. Exercises
Write a recursive form of minimum().
Write a recursive form of search().
Write a method that takes a root node and recursively prints all the values of the tree in order.
Write a method that takes a root node and iteratively prints all the values of the tree in order.
Write a method that takes a root node and recursively prints all the values of the tree pre-order.
Write a method that takes a root node and recursively prints all the values of the tree post-order.
Write a method(s) that inserts values from a sorted list into a binary search tree in such a way as to maintain balance yet require no explicit balancing.
Add method(s) to Node to recursively calculate its size.
Add method(s) to Node to recursively calculate its height.
