Скачать или смотреть GFG Serialize and deserialize a binary tree

🌳 Serialization
Create a helper function serialize that takes a Node* root as input.
If the root is nullptr, push -1 into the result array and return.
Push the root-data into the result array.
Recursively call serialize on the left child of the root.
Recursively call serialize on the right child of the root.
📦 Deserialization
Create a helper function deSerialize that takes a vector A (representing the serialized tree) and returns a Node*.
Initialize a global variable i to 0 (to keep track of the current index in the serialized array).
Read the value at index i from the A array and increment i.
If the value is -1, return nullptr (indicating a null node).
Create a new node with the value and recursively call deSerialize to construct its left and right subtrees.
✅ Complete Description
To serialize a tree, we recursively add each node's value to the array. For deserialization, we read each value from the array and create a new node. If the value is -1, we return nullptr to indicate a null node.

This approach ensures that the tree can be serialized and deserialized correctly, preserving the original tree structure.

You can test the serialization and deserialization with different binary trees to verify that the process works correctly.



#geeksforgeeks #potd #leetcode #algorithm #binarytree #leetcode #daily #likesharesubscribe
#subscribe #share