The maximum height of a binary tree with 15 nodes occurs when the tree is skewed, which can have a height of 15.

The maximum number of nodes at level 'h' in a binary tree is 2^h, as each node can have two children.

In a complete binary tree, the last level can have up to 2^(h-1) nodes, where h is the total number of levels.

Side-order is not a recognized binary tree traversal method; valid methods include in-order, pre-order, and post-order.

In-order traversal visits nodes in the order of left child, root, and then right child.