1. Describe an implementation of Pred and Succ operations on the binary search trees
  2. Show that walking the complete binary tree using operation Succ needs time Θ(n).
  3. Describe algorithm that given an ordered array of elements constructs perfectly balanced binary search tree.
Naposledy změněno: středa, 1. dubna 2020, 17.50