As it turns out Chapter 18 only less than 20 pages. While it's still more in-depth than many discussions of balanced trees, one can see the authors are not big on this topic (like deletion is not even described and left for the author).
In any case, though the algorithm is more difficult than a binary tree. It is much easier to understand than red-black tree. More importantly - it is simpler to visualize what really going on. So I decide to skip the algorithmic description for the moment.
No comments:
Post a Comment