pokerentrancement

1. Serialize A Binary Tree

1. // A C++ Program serialize and deserialize an N-ary tree
2. #define MARKER ')'
3. usingnamespace std;
4. // A node of N-ary tree
5. char key;
6. Node *child[N];// An array of pointers for N children
7. // A utility function to create a new N-ary tree node
8. {
9. temp->key = key;
10. temp->child[i]=NULL;
11. }
12. // This function stores the given N-ary tree in a file pointed by fp
13. {
14. if(root NULL)return;
15. // Else, store current node and recur for its children
16. for(int i =0; i < N && root->child[i]; i++)
17. fprintf(fp, '%c ', MARKER);
18. // This function constructs N-ary tree from a file pointed by 'fp'.
19. // This functionr returns 0 to indicate that the next item is a valid
20. int deSerialize(Node *&root, FILE*fp)
21. // Read next item from file. If theere are no more items or next
22. char val;
23. return1;
24. // Else create node with this item and recur for children
25. for(int i =0; i < N; i++)
26. break;
27. // Finally return 0 for successful finish
28. }
29. // A utility function to create a dummy tree shown in above diagram
30. {
31. root->child[0]= newNode('B');
32. root->child[2]= newNode('D');
33. root->child[0]->child[1]= newNode('F');
34. root->child[2]->child[1]= newNode('H');
35. root->child[2]->child[3]= newNode('J');
36. root->child[0]->child[1]->child[0]= newNode('K');
37. }
38. // A utlity function to traverse the constructed N-ary tree
39. {
40. {
41. for(int i =0; i < N; i++)
42. }
43. int main()
44. // Let us create an N-ary tree shown in above diagram
45. // Let us open a file and serialize the tree into the file
46. if(fp NULL)
47. puts('Could not open file');
48. }
49. fclose(fp);
50. // Let us deserialize the storeed tree into root1
51. fp =fopen('tree.txt', 'r');
52. traverse(root1);
53. return0;

Binary Tree Serialization. Design an algorithm and write code to serialize and deserialize a binary tree. It's given by your own serialize method.

Serialize A Binary Tree