lec04-trees.pptVIP

CS202 - Fundamentals of Computer Science II lec04-trees What is a (General) Tree? A (general) tree is a set of nodes with the following properties: The set can be empty. Otherwise, the set is partitioned into k+1 disjoint subsets: a tree consists of a distinguished node r, called root, and zero or more nonempty sub-trees T1, T2, … , Tk, each of whose roots are connected by an edge from r. T is a tree if either T has no nodes, or T is of the form r . . . T1 T2 . . . . . . Tk where r is a node and T1, T2, ..., Tk are trees. What is a (General) Tree? (cont.) The root of each sub-tree is said to be child of r, and r is the parent of each sub-tree root. If a tree is a collection of N nodes, then it has N-1 edges. A path from node n1 to nk is defined as a sequence of nodes n1,n2, …,nk such that ni is parent of ni+1 (1 ≤ i k) There is a path from every node to itself. There is exactly one path from the root to each node. A Tree – Example Tree Terminology Parent – The parent of node n is the node directly above in the tree. Child – The child of node n is the node directly below in the tree. If node m is the parent of node n, node n is the child of node m. Root – The only node in the tree with no parent. Leaf – A node with no children. Siblings – Nodes with a common parent. Ancestor – An ancestor of node n is a node on the path from the root to n. Descendant – A descendant of node n is a node on the path from n to a leaf. Subtree – A subtree of node n is a tree that consists of a child (if any) of n and the child’s descendants (a tree which is rooted by a child of node n) Level of a node Level – The level of node n is the number of nodes on the path from root to node n. Definition – The level of node n in a tree T. If n is the root of T, the level of n is 1. If n is not the root of T, its level is 1 greater than the level of its parent. Height of A Tree Height – The number of nodes on the longest path from the root to a