DataStructures数据结构Course7Tree教学课件.pptVIP

A O S U I D E R N M C G K T 1 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 A=000 U=0101 E=100 M=11000 K=11011 O=001 I=0110 R=1010 C=11001 T=111 S=0100 D=0111 N=1011 G=11010 Figure 7-24 Huffman code assignment The result 7-7 summary Tree consists of nodes(elements) and branch(directed lines) Degree – the number of branches associated with a node Indegree—directed toward the node Outdegree — directed away from the node Root—the first node with indegree of zero All node ,except root have an indegree of one Leaf—with an outdegree of zero Internal node—neither the root nor the leaf Parent, child , siblings Path—a sequences of nodes in which each node is adjacent to the next one An ancestor—any node in the path from the root of a given node Descendent—any node in all of the paths from a given node to a leaf Level—the distance from the root Height—the level of the leaf in the longest path from the root +1 Subtree—any connected structure below the root Binary tree—no node have more than two children Hmin = Hmax= N Hmin = H Nmax = 2n + 1 7-7 summary Balance factor : B = HL - HR Balanced tree B = 0 Binary balanced tree B = 1 Complete tree—the last level is full nearly complete tree—has the minimum height for its nodes and all nodes in the last level are found on the left A binary tree traversal – visits eachnode of the tree once and only once in a predetermined sequence Depth first—preorder(NLR), inorder(LNR), postorder(LRN),… Breadth-first—process all nodes in a level before processing to the next level A general tree—each node can have an unlimited outdegree Changing a general tree to a binary tree—identify the leftmost children ; connected the siblings from left to right ; delete the unused branches Huffman code—uses a variable-length code to represent characters, shorter code assigns to characters that occur more frequently To create Huffman code—determine the number of occu