Messages in this thread | | | Date | 10 Jan 1998 21:50:00 +0200 | From | (Kai Henningsen) | Subject | Re: 2.1.78: mm and networking questions... |
| |
kwrohrer@enteract.com wrote on 09.01.98 in <199801092245.QAA09157@jadrek.kwr>:
> Well, you got license to a solid, lean red-black tree implementation? > If so, drop it in! Same for a solid, lean AVL tree implementation. > If starting from scratch I'd prefer the red-black tree because > I know there are good algorithm descriptions out there; I haven't > seen good pseudo-code for AVL trees yet.
The "Handbook of Algorithms and Data Structures" has vode for AVL insert and left rotation, if you're interested. Not so for red-black trees.
MfG Kai
| |