摘要：
Implement insert and delete in a tri-nary tree. A tri-nary tree is much like a binary tree but with three child nodes for each parent instead of two -- with the left node being values less than the parent, the right node values greater than the parent, and the middle nodes values equal to the parent. 阅读全文
卖萌的弱渣我是一个记性不好的弱渣程序员，一直在学习，一直在忘记。建个博客，把忘记的东西记下来 |