Thenoun explains tree data structure used in the concept of recursion :the subtree tree or tree ;degree :a tree number ;trees :tree of any node in the maximum & # brothers: two ;20540 ;the same node parent ;layer :root in the first layer ,and so on ;height: a leaf node the height is 1 ,the highest root node ;ordered tree :each node in the tree is of the order of ;forest :multiple tree ;tree representation 1 parents said law :each node stores :data ,parent in the index in the array ;2 children :representation of all nodes in an array ,Cheap Vibram Five Fingers,each array pointing to a single list ,storing the child ;as shown below: 3 .
Parents children representation 4 kid brother said method the advantage of this method is that a tree can be converted into a binary tree, is a tree into a binary tree method ;linear table is a special case of oblique tree ;tree :all nodes with only the left or right node node ;for example :full binary tree :a leaf node must be in the last layer, and all leaf nodes are left child And right child ;complete binary tree : from left to right ,from top to bottom constructing binary tree ;for example : the nature of 1 I layers of at least a node ;2 depth of K tree has at most k - 1 node ;3 arbitrary binary tree, the number of nodes of degree 0 = degree 2 of the number of nodes and # 43 ;1 ;4 if I is father number ,Ray Ban Sunglasses,then the child as number 2I and 2i& # 43 ;1 ;5 if the child number is k ,then father as number floor ( K / 2 ) ;binary tree storage structure ( 1) :only sequential storage for complete binary tree ;( 2) storage : the most common storage methods ;but it is a waste of space ,because there will be a lot of null pointer ( if the N nodes, there are 2n left ,right pointer ,but used only n-1 pointer ) improved :binary tree :a null pointer link to predecessor or successor node ;( the precursor and successor is in accordance with the preorder about ) the node data structure is as follows :for example :the general structure of threaded binary tree process steps are as follows :( 1) the general structure of binary tree traversal of a binary tree ;(2) the establishment of binary tree ,binary tree traversal ( ;1) the former preorder :first .
Left child ,then ,Coach Bag Sale,finally right child ;( 2) traversal :first left child ,parents ,Nike Running Shoes Women,and finally right child ;( 3) after the preorder :first left child ,then right child ,the parents
;( 4) hierarchical traversal :a layer, from left to right ,from top to next traversal ;note: ( 1) the known sequence ,after the traversal results ,cannot be deduced from a tree to determine
the tree ;( 2) the known sequence ,traversal results ,can be deduced from the results after the traversal ;( 2) the known sequence ,after the traversal of the results ,to derive the
preorder traversal results ;forest ,tree ,binary tree conversion tree -- > ;binary tree according to the brothers child representation conversion ;forest -- > ;binary tree binary tree
binary tree - the tree -- > ;> ;Huffman Huffman forest code is a prefix code; Huffman coding based on the Huffman tree on the basis of, therefore, in order to carry out Huffman coding
,must build Huffman tree ;tree path length of each leaf node to the root node of the path and; weighted path length is ( each leaf node of the path length and the Huffman * WI ) ;tree
is the minimum weighted path length of the binary tree structure of Huffm ;An tree process :(1 ) each node according to the weight from small to large order ;( 2) to a minimum weight
of two nodes ,and create a parent node as the two node ,parents of the weights of the nodes as a child node weight and ,then the parent node in the original cohort ( 3 ;repeat ( 2
) ) steps ,until the queue is only one node ,the node is the root node ;structure of Huffman tree, can be carried out Huffman coding ,coding rules :( 1) the left branch in 0 ,right
branching fill 1 ;Huffman decoding process ( 1) given a string of 01 ,to be 01 series of Huffman tree ,to leaf nodes on a node that is decoded ,Coach Online Outlet,and then again to traverse the Huffman
Related articles：
没有评论:
发表评论