Buy GNU books!
|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
Despite the earlier discussion (see section 8.8 Traversal), there are actually three cases, not two, in advancing within a threaded binary tree. The extra case turns up when the current node is the null item. We deal with that case by calling out to tbst_t_first().
Notice also that, below, in the case of following a thread we must check for a null node, but not in the case of following a child pointer.
See also: [ Knuth 1997], algorithm 2.3.1S.
|webmaster donations bookstore||delorie software privacy|
|Copyright © 2003 by The Free Software Foundation||Updated Jun 2003|