Leetcode 297. Serialize and Deserialize Binary Tree

Implement two complementary algorithms to convert a binary tree to a string and back, preserving exact node values and tree structure (including null children) so the process is reversible; common approaches use preorder DFS with null markers or level-order with placeholders. Ensure correctness and efficiency for trees up to ~10^4 nodes.