Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on An interesting data structure with search time O(sqrt n). Parent comment
> There are many types of binary search trees. AVL trees and red-black trees are both forms of self-balancing binary search trees.
There are no comments on this comment yet.
> There are many types of binary search trees. AVL trees and red-black trees are both forms of self-balancing binary search trees.