一,二叉树:
Theorem 1:
The number of leaves in a non-empty full binary tree is one more than the number of internal nodes.
Theorem 2:
The number of null pointers in a non-empty binary tree is one more than the number of nodes in the tree.
Preorder traversal:
Postorder traversal:
Inorder traversal: