From Hex Fiend Wiki

Developers: ThreadedAVLTree

Threaded AVL trees ("tavl trees") are binary search trees in which nodes with no left and/or right pointer hijack the empty pointers to refer back to their parent. This provides the following nice properties:



See Ben Pfaff's GNU libavl for a discussion of threaded AVL trees and a list of tree implementations, including his own. Ben's implementation is released under the GPL, which precludes Hex Fiend from using it; therefore Hex Fiend uses Bert Hughes's public domain implementation here. Much gratitude to Bert, wherever he is.

TavlTreeByteArray uses a tavl tree as its data representation.

Retrieved from http://ridiculousfish.com/hexfiend1/docs/wiki/index.php/Developers/ThreadedAVLTree
Page last modified on October 22, 2006, at 10:42 AM