Data structure, algorithms and applications-12th-12 fork Tree

One or two properties of a fork tree

1. Attribute 1: Each binary tree that is drawn with n elements (n>0) has a n-1 edge

2. The height of H (h>=0) of the two-fork tree in the tree at least H and more 2h-1 elements

Proof: The number of elements is at least h because of at least one element per layer. Each element has a maximum of two children, so the number of elements in layer I is at most 2i-1 (i>0). For h=0, the total number of elements is 0, which equals 20-1. For h>0, the number of elements cannot exceed

Two

Data structure, algorithms and applications-12th-12 fork Tree