Open In App

Serialize and Deserialize an N-ary Tree

Last Updated : 26 Mar, 2024
Improve
Improve
Like Article
Like
Save
Share
Report

Given an N-ary tree where every node has the most N children. How to serialize and deserialize it? Serialization is to store a tree in a file so that it can be later restored. The structure of the tree must be maintained. Deserialization is reading the tree back from the file.

This post is mainly an extension of the below post. Serialize and Deserialize a Binary Tree

In an N-ary tree, there are no designated left and right children. An N-ary tree is represented by storing an array or list of child pointers with every node. 

The idea is to store an ‘end of children’ marker with every node. The following diagram shows serialization where ‘)’ is used as the end of the children’s marker. 

Following is the implementation of the above idea.  

C++ 
// A C++ Program serialize and deserialize an N-ary tree
#include<cstdio>
#define MARKER ')'
#define N 5
using namespace std;

// A node of N-ary tree
struct Node {
   char key;
   Node *child[N];  // An array of pointers for N children
};

// A utility function to create a new N-ary tree node
Node *newNode(char key)
{
    Node *temp = new Node;
    temp->key = key;
    for (int i = 0; i < N; i++)
        temp->child[i] = NULL;
    return temp;
}

// This function stores the given N-ary tree in a file pointed by fp
void serialize(Node *root, FILE *fp)
{
    // Base case
    if (root == NULL) return;

    // Else, store current node and recur for its children
    fprintf(fp, "%c ", root->key);
    for (int i = 0; i < N && root->child[i]; i++)
         serialize(root->child[i],  fp);

    // Store marker at the end of children
    fprintf(fp, "%c ", MARKER);
}

// This function constructs N-ary tree from a file pointed by 'fp'.
// This function returns 0 to indicate that the next item is a valid
// tree key. Else returns 0
int deSerialize(Node *&root, FILE *fp)
{
    // Read next item from file. If there are no more items or next
    // item is marker, then return 1 to indicate same
    char val;
    if ( !fscanf(fp, "%c ", &val) || val == MARKER )
       return 1;

    // Else create node with this item and recur for children
    root = newNode(val);
    for (int i = 0; i < N; i++)
      if (deSerialize(root->child[i], fp))
         break;

    // Finally return 0 for successful finish
    return 0;
}

// A utility function to create a dummy tree shown in above diagram
Node *createDummyTree()
{
    Node *root = newNode('A');
    root->child[0] = newNode('B');
    root->child[1] = newNode('C');
    root->child[2] = newNode('D');
    root->child[0]->child[0] = newNode('E');
    root->child[0]->child[1] = newNode('F');
    root->child[2]->child[0] = newNode('G');
    root->child[2]->child[1] = newNode('H');
    root->child[2]->child[2] = newNode('I');
    root->child[2]->child[3] = newNode('J');
    root->child[0]->child[1]->child[0] = newNode('K');
    return root;
}

// A utility function to traverse the constructed N-ary tree
void traverse(Node *root)
{
    if (root)
    {
        printf("%c ", root->key);
        for (int i = 0; i < N; i++)
            traverse(root->child[i]);
    }
}

// Driver program to test above functions
int main()
{
    // Let us create an N-ary tree shown in above diagram
    Node *root = createDummyTree();

    // Let us open a file and serialize the tree into the file
    FILE *fp = fopen("tree.txt", "w");
    if (fp == NULL)
    {
        puts("Could not open file");
        return 0;
    }
    serialize(root, fp);
    fclose(fp);

    // Let us deserialize the stored tree into root1
    Node *root1 = NULL;
    fp = fopen("tree.txt", "r");
    deSerialize(root1, fp);

    printf("Constructed N-Ary Tree from file is \n");
    traverse(root1);

    return 0;
}
Java 
import java.io.*;

public class NAryTreeSerialization {
    final static int N = 5;
    final static char MARKER = ')';

    // A node of N-ary tree
    static class Node {
        char key;
        Node[] child; // An array of pointers for N children

        Node(char key) {
            this.key = key;
            child = new Node[N];
        }
    }

    // This function stores the given N-ary tree in a file pointed by fp
    static void serialize(Node root, PrintWriter writer) {
        // Base case
        if (root == null) {
            return;
        }

        // Else, store current node and recur for its children
        writer.print(root.key + " ");
        for (int i = 0; i < N && root.child[i] != null; i++) {
            serialize(root.child[i], writer);
        }

        // Store marker at the end of children
        writer.print(MARKER + " ");
    }

    // This function constructs N-ary tree from a file pointed by 'reader'.
    static Node deSerialize(BufferedReader reader) throws IOException {
        // Read next item from file. If there are no more items or next
        // item is marker, then return null to indicate same
        int val = reader.read();
        if (val == -1 || val == MARKER) {
            return null;
        }
        char c = (char) val;

        // Else create node with this item and recur for children
        Node root = new Node(c);
        for (int i = 0; i < N; i++) {
            root.child[i] = deSerialize(reader);
            if (root.child[i] == null) {
                break;
            }
        }

        return root;
    }

    // A utility function to create a dummy tree shown in above diagram
    static Node createDummyTree() {
        Node root = new Node('A');
        root.child[0] = new Node('B');
        root.child[1] = new Node('C');
        root.child[2] = new Node('D');
        root.child[0].child[0] = new Node('E');
        root.child[0].child[1] = new Node('F');
        root.child[2].child[0] = new Node('G');
        root.child[2].child[1] = new Node('H');
        root.child[2].child[2] = new Node('I');
        root.child[2].child[3] = new Node('J');
        root.child[0].child[1].child[0] = new Node('K');
        return root;
    }

    // A utility function to traverse the constructed N-ary tree
    static void traverse(Node root) {
        if (root != null) {
            System.out.print(root.key + " ");
            for (int i = 0; i < N; i++) {
                traverse(root.child[i]);
            }
        }
    }

    // Driver program to test above functions
    public static void main(String[] args) throws IOException {
        // Let us create an N-ary tree shown in above diagram
        Node root = createDummyTree();

        // Let us open a file and serialize the tree into the file
        PrintWriter writer = new PrintWriter(new FileWriter("tree.txt"));
        serialize(root, writer);
        writer.close();

        // Let us deserialize the stored tree into root1
        Node root1;
        BufferedReader reader = new BufferedReader(new FileReader("tree.txt"));
        root1 = deSerialize(reader);
        reader.close();

        System.out.println("Constructed N-Ary Tree from file is: ");
        traverse(root1);
        }
}
C# 
using System;
using System.IO;

public class GFG {
    const int N = 5;
    const char MARKER = ')';

    // A node of N-ary tree
    class Node {
        public char key;
        public Node[] child; // An array of pointers for N
                             // children

        public Node(char key)
        {
            this.key = key;
            child = new Node[N];
        }
    }

    // This function stores the given N-ary tree in a file
    // pointed by fp
    static void serialize(Node root, StreamWriter writer)
    {
        // Base case
        if (root == null) {
            return;
        }

        // Else, store current node and recur for its
        // children
        writer.Write(root.key + " ");
        for (int i = 0; i < N && root.child[i] != null;
             i++) {
            serialize(root.child[i], writer);
        }

        // Store marker at the end of children
        writer.Write(MARKER + " ");
    }

    // This function constructs N-ary tree from a file
    // pointed by 'reader'.
    static Node deSerialize(StreamReader reader)
    {
        // Read next item from file. If there are no more
        // items or next item is marker, then return null to
        // indicate same
        int val = reader.Read();
        if (val == -1 || val == MARKER) {
            return null;
        }
        char c = (char)val;

        // Else create node with this item and recur for
        // children
        Node root = new Node(c);
        for (int i = 0; i < N; i++) {
            root.child[i] = deSerialize(reader);
            if (root.child[i] == null) {
                break;
            }
        }

        return root;
    }
    // A utility function to create a dummy tree shown in
    // above diagram
    static Node createDummyTree()
    {
        Node root = new Node('A');
        root.child[0] = new Node('B');
        root.child[1] = new Node('C');
        root.child[2] = new Node('D');
        root.child[0].child[0] = new Node('E');
        root.child[0].child[1] = new Node('F');
        root.child[2].child[0] = new Node('G');
        root.child[2].child[1] = new Node('H');
        root.child[2].child[2] = new Node('I');
        root.child[2].child[3] = new Node('J');
        root.child[0].child[1].child[0] = new Node('K');
        return root;
    }

    // A utility function to traverse the constructed N-ary
    // tree
    static void traverse(Node root)
    {
        if (root != null) {
            Console.Write(root.key + " ");
            for (int i = 0; i < N; i++) {
                traverse(root.child[i]);
            }
        }
    }
    // Driver program to test above functions
    static void Main(string[] args)
    {
        // Let us create an N-ary tree shown in above
        // diagram
        Node root = createDummyTree();

        // Let us open a file and serialize the tree into
        // the file
        StreamWriter writer = new StreamWriter("tree.txt");
        serialize(root, writer);
        writer.Close();

        // Let us deserialize the stored tree into root1
        Node root1;
        StreamReader reader = new StreamReader("tree.txt");
        root1 = deSerialize(reader);
        reader.Close();

        Console.WriteLine(
            "Constructed N-Ary Tree from file is: ");
        traverse(root1);
    }
}
Javascript 
// Define a class for the Node of the N-ary tree
class Node {
    constructor(key) {
        this.key = key;
        this.children = [];
    }
}

// Utility function to create a new N-ary tree node
function newNode(key) {
    return new Node(key);
}

// This function stores the given N-ary tree in a string
function serialize(root) {
    // Base case
    if (!root) return "";

    // Else, store current node and recur for its children
    let serialized = root.key + " ";
    for (const child of root.children) {
        serialized += serialize(child);
    }

    // Store marker at the end of children
    serialized += ") ";

    return serialized;
}

// This function constructs N-ary tree from a string.
function deserialize(serialized) {
    const values = serialized.split(" ");
    let index = 0;

    function buildTree() {
        // Read next item from string. If there are no more items or next
        // item is marker, then return null to indicate same
        const value = values[index++];
        if (!value || value === ")") return null;

        // Else create node with this item and recur for children
        const node = newNode(value);
        while (true) {
            const child = buildTree();
            if (!child) break;
            node.children.push(child);
        }

        // Finally return the node for successful finish
        return node;
    }

    return buildTree();
}

// A utility function to create a dummy tree shown in above diagram
function createDummyTree() {
    const root = newNode('A');
    root.children = [newNode('B'), newNode('C'), newNode('D')];
    root.children[0].children = [newNode('E'), newNode('F')];
    root.children[2].children = [newNode('G'), newNode('H'), newNode('I'), newNode('J')];
    root.children[0].children[1].children = [newNode('K')];
    return root;
}

// A utility function to traverse the constructed N-ary tree
function traverse(root) {
    if (root) {
        console.log(root.key, " ");
        for (const child of root.children) {
            traverse(child);
        }
    }
}

// Driver program to test above functions
function main() {
    // Let us create an N-ary tree shown in above diagram
    const root = createDummyTree();

    // Let us serialize the tree into a string
    const serializedTree = serialize(root);
    console.log("Serialized N-Ary Tree: ", serializedTree);

    // Let us deserialize the stored tree into root1
    const root1 = deserialize(serializedTree);

    console.log("Constructed N-Ary Tree from string is ");
    traverse(root1);
}

main();
Python3 
# A Python program to serialize and deserialize an N-ary tree
import sys

# A node of N-ary tree
class Node:
    def __init__(self, key):
        self.key = key
        self.children = []

# A utility function to create a new N-ary tree node
def newNode(key):
    temp = Node(key)
    return temp

# This function stores the given N-ary tree in a file pointed by fp
def serialize(root, fp):
    # Base case
    if not root:
        return

    # Else, store current node and recur for its children
    fp.write(root.key + " ")
    for child in root.children:
        serialize(child, fp)

    # Store marker at the end of children
    fp.write(") ")

# This function constructs N-ary tree from a file pointed by 'fp'.
# This function returns 0 to indicate that the next item is a valid
# tree key. Else returns 0
def deSerialize(fp):
    # Read next item from file. If there are no more items or next
    # item is marker, then return None to indicate same
    val = fp.read(1)
    if not val or val == ")":
        return None

    # Else create node with this item and recur for children
    root = newNode(val)
    while True:
        child = deSerialize(fp)
        if not child:
            break
        root.children.append(child)

    # Finally return the node for successful finish
    return root

# A utility function to create a dummy tree shown in above diagram
def createDummyTree():
    root = newNode('A')
    root.children = [newNode('B'), newNode('C'), newNode('D')]
    root.children[0].children = [newNode('E'), newNode('F')]
    root.children[2].children = [newNode('G'), newNode('H'), newNode('I'), newNode('J')]
    root.children[0].children[1].children = [newNode('K')]
    return root

# A utility function to traverse the constructed N-ary tree
def traverse(root):
    if root:
        print(root.key, end=" ")
        for child in root.children:
            traverse(child)

# Driver program to test above functions
def main():
    # Let us create an N-ary tree shown in above diagram
    root = createDummyTree()

    # Let us open a file and serialize the tree into the file
    fp = open("tree.txt", "w")
    serialize(root, fp)
    fp.close()

    # Let us deserialize the stored tree into root1
    fp = open("tree.txt", "r")
    root1 = deSerialize(fp)
    fp.close()

    print("Constructed N-Ary Tree from file is ")
    traverse(root1)

if __name__ == '__main__':
    main()

Output
Constructed N-Ary Tree from file is 
A B E F K C D G H I J

Time Complexity: O(N), where n is number of nodes.
Auxiliary Space: O(H+N) , where h is height of tree and n is number of nodes.

The above implementation can be optimized in many ways for example by using a vector in place of array of pointers. We have kept it this way to keep it simple to read and understand.

 



V

varun
Improve
Previous Article
Sum of all elements of N-ary Tree
Next Article
Check if the given n-ary tree is a binary tree

Similar Reads

Serialize and Deserialize a Binary Tree
Serialization is to store the tree in a file so that it can be later restored. The structure of the tree must be maintained. Deserialization is reading the tree back from a file. Recommended PracticeSerialize and Deserialize a Binary TreeTry It! Following are some simpler versions of the problem: If given Tree is a Binary Search Tree? If the given
12 min read
Serialize and Deserialize array of string
We have given an array of string and we have to serialize the array of string and deserialize the serialized string. Examples: Input : "geeks", "are", "awesome" Output : Serialized String : 5~geeks3~are7~awesome Deserialized String : geeks are awesome Input : "hello", "guys", "whats", "up!!!" Output : Serialized String : 5~hello4~guys5~whats5~up!!!
5 min read
Tree of Space - Locking and Unlocking N-Ary Tree
Given a world map in the form of Generic M-ary Tree consisting of N nodes and an array queries[], the task is to implement the functions Lock, Unlock and Upgrade for the given tree. For each query in queries[], the functions return true when the operation is performed successfully, otherwise it returns false. The functions are defined as: X: Name o
10 min read
Build a segment tree for N-ary rooted tree
Prerequisite: Segment tree and depth first search.In this article, an approach to convert an N-ary rooted tree( a tree with more than 2 children) into a segment tree is discussed which is used to perform a range update queries. Why do we need a segment tree when we already have an n-ary rooted tree? Many times, a situation occurs where the same ope
15+ min read
Check if the given n-ary tree is a binary tree
Given an n-ary tree, the task is to check whether the given tree is binary or not. Examples: Input: A / \ B C / \ \ D E F Output: Yes Input: A / | \ B C D \ F Output: No Approach: Every node in a binary tree can have at most 2 children. So, for every node of the given tree, count the number of children and if for any node the count exceeds 2 then p
6 min read
Remove all leaf nodes from a Generic Tree or N-ary Tree
Given a Generic tree, the task is to delete the leaf nodes from the tree. Examples: Input: 5 / / \ \ 1 2 3 8 / / \ \ 15 4 5 6 Output: 5 : 1 2 3 1 : 2 : 3 : Explanation: Deleted leafs are: 8, 15, 4, 5, 6 Input: 8 / | \ 9 7 2 / | \ | / / | \ \ 4 5 6 10 11 1 2 2 3 Output: 8: 9 7 2 9: 7: 2: Approach: Follow the steps given below to solve the problem Co
9 min read
Count of nodes in given N-ary tree such that their subtree is a Binary Tree
Given an N-ary tree root, the task is to find the count of nodes such that their subtree is a binary tree. Example: Input: Tree in the image below Output: 11Explanation: The nodes such that there subtree is a binary tree are {2, 8, 10, 6, 7, 3, 1, 9, 5, 11, 12}. Input: Tree in the image below Output: 9 Approach: The given problem can be solved by u
11 min read
Insertion in n-ary tree in given order and Level order traversal
Given a set of parent nodes where the index of the array is the child of each Node value, the task is to insert the nodes as a forest(multiple trees combined together) where each parent could have more than two children. After inserting the nodes, print each level in a sorted format. Example: Input: arr[] = {5, 3, -1, 2, 5, 3} Output:-1 231 5Input:
10 min read
Difference between sums of odd level and even level nodes in an N-ary Tree
Given an N-ary Tree rooted at 1, the task is to find the difference between the sum of nodes at the odd level and the sum of nodes at even level. Examples: Input: 4 / | \ 2 3 -5 / \ / \ -1 3 -2 6Output: 10Explanation:Sum of nodes at even levels = 2 + 3 + (-5) = 0Sum of nodes at odd levels = 4 + (-1) + 3 + (-2) + 6 = 10Hence, the required difference
9 min read
Locking and Unlocking of Resources arranged in the form of n-ary Tree
Given an n-ary tree of resources arranged hierarchically such that height of tree is O(Log N) where N is total number of nodes (or resources). A process needs to lock a resource node in order to use it. But a node cannot be locked if any of its descendant or ancestor is locked. Following operations are required for a given resource node: islock()-
11 min read
Article Tags :
Practice Tags :
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox