This section actually did a good job of abating some of my concerns regarding BSTs and AVL trees. When I last took a course on data structures I remember being intimidated by them, but it was refreshing to find that these aren't quite as complicated as I remembered as a young CS student.
That said, AVL trees still leave me a little uneasy as to the coding implementation. I also would like to understand how to handle the third case of deleting nodes from a standard BST: when a node has two children. I'm having trouble thinking about how that would be programmed algorithmically.
No comments:
Post a Comment