Problems for practicals: binary search trees
Completion requirements
- Describe an implementation of Pred and Succ operations on the binary search trees
- Show that walking the complete binary tree using operation Succ needs time Θ(n).
- Describe algorithm that given an ordered array of elements constructs perfectly balanced binary search tree.
Last modified: Wednesday, 1 April 2020, 5:50 PM