Objectives¶
At the end of this part each student will be able to:
accurately and precisely describe the concepts of binary search trees and ordered symbol tables;
implement algorithms based on search trees;
evaluate and implement classical representations of search trees;
