How does binary tree insertion work and what are the key steps involved in inserting a new node into a binary tree?

Binary tree insertion involves adding a new node to a binary tree while maintaining the tree's structure. The key steps in inserting a new node are:

1. Start at the root node and compare the value of the new node with the current node.
2. If the new node's value is less than the current node, move to the left child node. If it is greater, move to the right child node.
3. Repeat this process until reaching a leaf node (a node with no children).
4. Insert the new node as the left or right child of the leaf node, depending on its value compared to the leaf node's value.