Serialize and Deserialize Binary Tree | 3 Methods
Serialization is to store tree in a file so that it can be later restored. The structure of tree must be maintained. Deserialization is reading tree back from file.
Design an algorithm to serialize and deserialize a binary tree.
I have explained 3 methods to solve this.
Method 1: Using 2 tree traversals
Method 2: Using preorder traversal (DFS)
Method 3: Using Level order traversal (BFS)
Source code: https://github.com/fit-coder/fitcoder...
00:00 Introduction
00:11 Problem explanation
01:19 Method 1 - Using 2 tree traversals
04:16 Method 2 - Using preorder
09:50 Method 3 - Using Level order traversal
19:42 Implementation
Construct Binary Tree from Inorder and Preorder: • Construct Binary Tree From Inorder and Pre...
Construct Binary Tree from Inorder and Postorder: • Construct Binary Tree From Inorder and Pos...
Construct Binary Tree from Inorder and Leveorder: • Construct Binary Tree From Inorder and Lev...
-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------
For other binary tree tutorials, please refer to the below playlist:
• Tree Data Structures
For other binary search tree tutorials, please refer to the below playlist:
• Binary Search Tree
For in-depth Graph theory and implementation details, please refer to the below playlist:
• Graph Algorithms
#DataStructure,#Trees,#FitCoder,#Algorithm,#competitiveprogramming,#binarytree,#binarysearchtree