Binary tree properties and related formulas

1. The maximum number of nodes at the kth level of the binary tree: 2^(k-1) [ie the number of nodes at the kth level of the full binary tree]
2. The maximum number of nodes in the binary tree with a depth of m: 2^m-1 [ie the total number of nodes in the full binary tree 】Specific method
3. A node with a degree of 0 is 1 more than a node with a degree of 2: n0=n2+1 Proof
4. A binary tree with n nodes has a depth of at least: [log2 n]+1(log Take the integer part) can
be derived from the second article 5. A full binary tree must be a complete binary tree, a complete binary tree is generally not a full binary tree
6. The number of nodes with a degree of 1 of a complete binary tree is 1 or 0