Nos.
1. Each node can have max two children.
2. A leaf is a node with no children.
3. Full binary tree: every node has 0 or 2 children.
4. Leftmost is smallest, rightmost is largest.
5. A complete tree fills levels left to right.