九 树(ying).pptVIP

We have already discussed arrays, stacks, queues and linked lists which are called linear data structures. The reason for this is that the elements are arranged in a linear fashion (i.e., one-dimensional representation) In this chapter, we are going to discuss a very useful data structure call tree. A tree is called non- linear data structure because the elements of this data structure are arranged in a non-linear fashion i.e., they use two-dimensional representation. Familiar examples of trees are genealogies(家谱) and organization charts .trees are also used to organize inf