Implementation and Analysis of Binary Search Trees
As described earlier, binary search trees perform well only if the tree remains balanced. Unfortunately, keeping a binary search tree balanced is a more difficult problem than it may at first appear. Nevertheless, there are a few clever approaches one can take. One of the best approaches is to implement the
- 9.7. Implementation and Analysis of Binary Search Trees
- from Mastering Algorithms with C
- Publisher: O'Reilly Media, Inc.
- Released: August 1999
Share this highlighthttp://www.safaribooksonline.com/a/mastering-algorithms-with/19685810/