《数据结构 Data Structure》课程教学资源（PPT课件讲稿）06 非二叉树 Non-Binary Trees

6 Non-Binary Trees

1 6 Non-Binary Trees

Contents 6.1 General tree Definitions and Terminology 6.2 The Parent Pointer Implementation 6.3 General Tree Implementations 6.4 K-ary trees 6.5 Sequential Tree Implementations

Contents 6.1 General Tree Definitions and Terminology 6.2 The Parent Pointer Implementation 6.3 General Tree Implementations 6.4 K-ary Trees 6.5 Sequential Tree Implementations

Contents 6.1 General Tree Definitions and Terminology 6.2 The Parent Pointer Implementation 6.3 General Tree Implementations 6.4 K-ary trees 6.5 Sequential Tree Implementations

Contents 6.1 General Tree Definitions and Terminology 6.2 The Parent Pointer Implementation 6.3 General Tree Implementations 6.4 K-ary Trees 6.5 Sequential Tree Implementations

6. 1 General Tree Definitions and Terminology 6.1 General Tree Definitions and Terminology

4 6.1 General Tree Definitions and Terminology 6.1 General Tree Definitions and Terminology

6. 1 General Tree Definitions and Terminology General trees A Tree is a finite set of n(n>0)nodes such that One and only one node r, is called the root of The remaining nodes are partitioned into m(m≥0) disjoint subsets To,T1……Tm, each of which is a tree, and whose roots ro, rl.....rm-i respectively are children of r The subsets T(0si<m) are said to be subtrees of t

General Trees A Tree is a finite set of n (n>0) nodes such that • One and only one node R, is called the root of T. • The remaining nodes are partitioned into m(m0) disjoint subsets T0 ,T1…..Tm-1 , each of which is a tree, and whose roots R0 , R1…..Rm-1 , respectively, are children of R. • The subsets Ti (0i<m) are said to be subtrees of T. 6.1 General Tree Definitions and Terminology