We had 4 days for our AVL tree.. taking DS2 over the summer was nice, no time for BS in the projects, we just inserted int's into our structures to prove they worked, then went on with the next project.
Of course, my AVL tree was actually broken below 4 branches deep, but oh well. BST is definately easier to maintain, but you still can wind up with one reaaaaally long branch that turns into a linked list, and all your effort is wasted. I've heard that a Red/Black tree is easier than AVL, almost as fast, and fixes that BST problem.. dunno.
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
no subject
Date: 2004-03-29 07:59 am (UTC)Of course, my AVL tree was actually broken below 4 branches deep, but oh well. BST is definately easier to maintain, but you still can wind up with one reaaaaally long branch that turns into a linked list, and all your effort is wasted. I've heard that a Red/Black tree is easier than AVL, almost as fast, and fixes that BST problem.. dunno.
Binary I/O is easy.. and kinda fun too.