Search:

Okay, here's the final draft that I've asked Hammer to add to the FAQ:


Part III - Balanced Binary Search Trees


Binary search trees are easy to implement and understand for beginning...

>That's good but, you know, successfully might work better.
That too. :)

>Have you ever thought to publish a textbook?
I've toyed with the idea.

>it's easier to read code using left and right...

>Perhaps: ...implementation is arbitrarily as long... ?
No, that would make the sentence incomprehensible. ;)

>was successfully added for simplicity's sake
I don't like either, so I'll use "was...

Yay! First draft! Questions, comments, etc. Thanks. :)

Part III - Balanced Binary Search Trees


Binary search trees are easy to implement and understand for beginning programmers....