| www.delorie.com/gnu/docs/avl/libavl_35.html | search |
![]() Buy GNU books! | |
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The types for memory allocation and managing data as void * pointers were discussed previously (see section 3. The Table ADT), but to build a table implementation using BSTs we must define some additional types. In particular, we need struct bst_node to represent an individual node and struct bst_table to represent an entire table. The following sections take care of this.
5.2.1 Node Structure 5.2.2 Tree Structure 5.2.3 Maximum Height
| webmaster donations bookstore | delorie software privacy |
| Copyright © 2003 by The Free Software Foundation | Updated Jun 2003 |