next up previous
Next: 4.2 Binary Trees Up: 4.1 Introduction Previous: 4.1.3 The Tree ADT

4.1.4 Data Structures for Tree Representation

The data structure chosen should be able to support efficiently the ADT operations given above. Simple schemes include:

1.
Arrays
2.
Lists of children
3.
Leftmost child-right sibling representation
For a detailed discussion of data structures to support Tree ADT operations, refer to the book by Aho, Hopcroft, and Ullman (1983).



eEL,CSA_Dept,IISc,Bangalore