cs3460_ch4_bin_tree 美国高校《数据结构》（Data Structure），共9章 节 ，英文版.pptVIP

Binary Trees the tree (a) is skewed to the left where the only non-nil children are in the left subtree a degenerate tree has at most one child, it is a linear structure This tree is complete This tree is not complete a complete binary tree is full at every level except the bottom level; at the bottom level all nodes are to the left A Short Proof Claim: The maximum number of nodes at the ith level of a binary tree is 2i-1 for i = 1 Proof: by inductionfor i = 1, there is one node and 21-1 = 20 = 1assume true for i = k with 2k-1 leaf nodesat the k+1 level, every leaf node from the kth level