Buy GNU books!
|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
Red-black trees need their own data structure. Otherwise, there's no appropriate place to store each node's color. Here's a C type for a color and a structure for an RB node, using the rb_ prefix that we've adopted for this module:
The maximum height for an RB tree is higher than for an AVL tree, because in the worst case RB trees store nodes less efficiently:
/* Maximum RB height. */ #ifndef RB_MAX_HEIGHT #define @cindex RB_MAX_HEIGHT macro RB_MAX_HEIGHT 48 #endif
The other data structures for RB trees are the same as for BSTs or AVL trees.
1. Why is it okay to have both an enumeration type and a structure member named rb_color? [answer]
|webmaster||delorie software privacy|
|Copyright © 2003 by The Free Software Foundation||Updated Jun 2003|