The height of a rooted tree is the maximum number of edges on a path from the root to a leaf. Recall that the time needed to perform a search on a binary search tree is O(height) (to be precise, the number of comparisons is equal to height+1 in the worst case), and the same holds
|
Archives
December 2023
CategoriesBooksIntroduction to Data
|