九 树(ying).ppt

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 information in database system and to represent the syntactic（句法) structure of source programs in compilers. Advantages of this data structure is that insertion. deletion and searching ,etc., are more efficient than linear data structures. definition A tree is a collection called nodes, one of which is designated as root along with a relation that places a hierarchical structure on the nodes. Terminologies used Node This is the main component of any tree structure. each individual element of a tree can be called a node. Parent The parent of a node is the immediate predecessor of that node. Child The immediate successors of a node are called child nodes, the left child and the right child. Link( branch and edge) A link is a pointer to a node in the tree. A node can have more than one link. Root A root is a specially designated node in a tree. it is a node which has no parent. there can be only one root node in a tree. Path each node has to be reachable from the root through a unique sequence of arcs or links called a path. length of the path: the number of links in a path is called the length of the path. Leaf nodes Leaf node is a node which does not have any child node. Level The level of a node in the tree is the rank of the hierarchy. Height The height of a non-empty tree is the maximum level of a node in the tree. Degree(arity) The maximu