数据结构与算法分析 第三版 clifford 第6章课件.pptVIP

Chapter 6 General Trees 6.1 Definitions and Terminology 6.2 General Tree ADT 6.3 General Tree Implementations Parent Pointer Array-based Children List Linked Children List Array-based Left-child/Right-sibling Linked Left-child/Right-sibling Sequential Implementation General Trees (1) General Trees (2) A tree T is a finite set of one or more nodes such that there is one designated 特定的 node r called the root of T, and the remaining nodes in (T –{r}) are partitioned into k≥0 disjoint subsets T1, T2, ..., Tk, each of which is a tree, and whose roots r1, r2, ..., rk, respectively, are child