LeetCode 652: Find Duplicate Subtrees
A clear explanation of finding duplicate binary tree subtrees using postorder traversal, serialization, and a hash map.
Tag
Serialization
3 notes
LeetCode 449: Serialize and Deserialize BST
Serialize a binary search tree compactly with preorder traversal and rebuild it using BST value bounds.
LeetCode 428: Serialize and Deserialize N-ary Tree
Serialize an N-ary tree into a string and reconstruct the same tree using preorder traversal with child counts.