Thanks to visit codestin.com
Credit goes to tamnd.github.io

tag

#serialization

3 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 652: Find Duplicate Subtrees

Problem Restatement We are given the root of a binary tree. We need to find all duplicate subtrees. Two subtrees are duplicate when they have: Requirement Meaning Same structure The nodes are arranged in the same shape Same values Matching nodes have equal values For each kind of duplicate subtree, we only return one root node. For example, if the same subtree appears three times, we still add only one...
leetcode tree binary-tree hash-map depth-first-search serialization May 11, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 449: Serialize and Deserialize BST

Problem Restatement We need to design two methods: Method Meaning serialize(root) Convert a BST into a string deserialize(data) Convert that string back into the original BST The tree is guaranteed to be a binary search tree. There is no required format. Any format is valid as long as deserializing the serialized string reconstructs the same BST. The encoded string should be as compact as possible. The number of nodes is...
leetcode tree binary-search-tree dfs design serialization May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 428: Serialize and Deserialize N-ary Tree

Problem Restatement We are given an N-ary tree. An N-ary tree is a rooted tree where each node can have zero or more children. We need to design two methods: Method Meaning serialize(root) Convert the tree into a string deserialize(data) Convert the string back into the original tree There is no required serialization format. We can choose any format as long as it can rebuild the same tree structure. The...
leetcode tree n-ary-tree dfs serialization recursion May 10, 2026