Binary Trees: Traversals and Properties

Implement recursive pre-order, in-order, and post-order traversals.

Implement iterative pre-order and in-order traversals using an explicit stack.

Solve problems involving tree properties like maximum depth, diameter, and balanced status.

Solve path-finding problems, such as finding a root-to-leaf path with a given sum.

Serialize a binary tree to a string and deserialize it back to a tree.