Largest element in an N-ary Tree Last Updated : 21 Oct, 2024 Comments Improve Suggest changes Like Article Like Report Given an n-ary tree containing positive node values, the task is to find the node with the largest value in the given n-ary tree.Note: An n-ary tree is a tree where each node can have zero or more children nodes. Unlike a binary tree, which has at most two children per node (left and right), the n-ary tree allows for multiple branches or children for each node.Examples:Input:Output: 90Explanation: The node with the largest value in the tree is 90.Input:Output: 95Explanation: The node with the largest value in the tree is 95.Approach:The idea is to traverse the given n-ary tree recursively keeping track of the maximum value of nodes that occurred. After completing the traversal, print the maximum value obtained.Below is the implementation of the above approach: C++ // C++ Code to find the largest node value in // the given N-ary tree using recursion #include <bits/stdc++.h> using namespace std; class Node { public: int data; vector<Node*> children; Node(int val) { data = val; } }; // Recursive function to find the node // with the largest value int findLargestNode(Node* root) { // Check if the tree is empty if (!root) return INT_MIN; // Initialize with root node's value int maxVal = root->data; // Recur for all children and // find the maximum value for (auto child : root->children) { maxVal = max(maxVal, findLargestNode(child)); } return maxVal; } int main() { // Representation of given N-ary tree // 11 // / | \ // 21 29 90 // / / \ \ // 18 10 12 77 Node* root = new Node(11); root->children.push_back(new Node(21)); root->children.push_back(new Node(29)); root->children.push_back(new Node(90)); root->children[0]->children.push_back(new Node(18)); root->children[1]->children.push_back(new Node(10)); root->children[1]->children.push_back(new Node(12)); root->children[2]->children.push_back(new Node(77)); cout << findLargestNode(root) << endl; return 0; } Java // Java code to find the largest node value // in the given N-ary tree using recursion import java.util.*; class Node { int data; List<Node> children; Node(int val) { data = val; children = new ArrayList<>(); } } // Recursive function to find the node // with the largest value public class GfG { public static int findLargestNode(Node root) { // Check if the tree is empty if (root == null) return Integer.MIN_VALUE; // Initialize with root node's value int maxVal = root.data; // Recur for all children and // find the maximum value for (Node child : root.children) { maxVal = Math.max(maxVal, findLargestNode(child)); } return maxVal; } public static void main(String[] args) { // Representation of given N-ary tree // 11 // / | \ // 21 29 90 // / / \ \ // 18 10 12 77 Node root = new Node(11); root.children.add(new Node(21)); root.children.add(new Node(29)); root.children.add(new Node(90)); root.children.get(0).children.add(new Node(18)); root.children.get(1).children.add(new Node(10)); root.children.get(1).children.add(new Node(12)); root.children.get(2).children.add(new Node(77)); System.out.println(findLargestNode(root)); } } Python # Python code to find the largest node value # in the given N-ary tree using recursion class Node: def __init__(self, val): self.data = val self.children = [] # Recursive function to find the node # with the largest value def find_largest_node(root): # Check if the tree is empty if root is None: return float('-inf') # Initialize with root node's value max_val = root.data # Recur for all children and # find the maximum value for child in root.children: max_val = max(max_val, find_largest_node(child)) return max_val if __name__ == "__main__": # Representation of given N-ary tree # 11 # / | \ # 21 29 90 # / / \ \ # 18 10 12 77 root = Node(11) root.children.append(Node(21)) root.children.append(Node(29)) root.children.append(Node(90)) root.children[0].children.append(Node(18)) root.children[1].children.append(Node(10)) root.children[1].children.append(Node(12)) root.children[2].children.append(Node(77)) print(find_largest_node(root)) C# // C# code to find the largest node value // in the given N-ary tree using recursion using System; using System.Collections.Generic; class Node { public int data; public List<Node> children; public Node(int val) { data = val; children = new List<Node>(); } } // Recursive function to find the node // with the largest value class GfG { public static int FindLargestNode(Node root) { // Check if the tree is empty if (root == null) return int.MinValue; // Initialize with root node's value int maxVal = root.data; // Recur for all children and // find the maximum value foreach (Node child in root.children) { maxVal = Math.Max(maxVal, FindLargestNode(child)); } return maxVal; } public static void Main(string[] args) { // Representation of given N-ary tree // 11 // / | \ // 21 29 90 // / / \ \ // 18 10 12 77 Node root = new Node(11); root.children.Add(new Node(21)); root.children.Add(new Node(29)); root.children.Add(new Node(90)); root.children[0].children.Add(new Node(18)); root.children[1].children.Add(new Node(10)); root.children[1].children.Add(new Node(12)); root.children[2].children.Add(new Node(77)); Console.WriteLine(FindLargestNode(root)); } } JavaScript // JavaScript code to find the largest node value // in the given N-ary tree using recursion class Node { constructor(val) { this.data = val; this.children = []; } } // Recursive function to find the node // with the largest value function findLargestNode(root) { // Check if the tree is empty if (root === null) return Number.MIN_SAFE_INTEGER; // Initialize with root node's value let maxVal = root.data; // Recur for all children and // find the maximum value for (let child of root.children) { maxVal = Math.max(maxVal, findLargestNode(child)); } return maxVal; } // Representation of given N-ary tree // 11 // / | \ // 21 29 90 // / / \ \ // 18 10 12 77 const root = new Node(11); root.children.push(new Node(21)); root.children.push(new Node(29)); root.children.push(new Node(90)); root.children[0].children.push(new Node(18)); root.children[1].children.push(new Node(10)); root.children[1].children.push(new Node(12)); root.children[2].children.push(new Node(77)); console.log(findLargestNode(root)); Output90Time Complexity: O(n), where n is the number of nodes in the N-ary tree, as each node is visited once.Auxiliary Space : O(h), where h is the height of the tree. Comment More infoAdvertise with us Next Article Second Largest element in n-ary tree L lakshita Follow Improve Article Tags : Tree Recursion DSA tree-traversal Tree Traversals n-ary-tree +2 More Practice Tags : RecursionTree Similar Reads Introduction to Generic Trees (N-ary Trees) Generic trees are a collection of nodes where each node is a data structure that consists of records and a list of references to its children(duplicate references are not allowed). Unlike the linked list, each node stores the address of multiple nodes. Every node stores address of its children and t 5 min read What is Generic Tree or N-ary Tree? Generic tree or an N-ary tree is a versatile data structure used to organize data hierarchically. Unlike binary trees that have at most two children per node, generic trees can have any number of child nodes. This flexibility makes them suitable for representing hierarchical data where each node can 4 min read N-ary Tree TraversalsInorder traversal of an N-ary TreeGiven an N-ary tree containing, the task is to print the inorder traversal of the tree. Examples: Input: N = 3  Output: 5 6 2 7 3 1 4Input: N = 3  Output: 2 3 5 1 4 6 Approach: The inorder traversal of an N-ary tree is defined as visiting all the children except the last then the root and finall 6 min read Preorder Traversal of an N-ary TreeGiven an N-ary Tree. The task is to write a program to perform the preorder traversal of the given n-ary tree. Examples: Input: 3-Array Tree 1 / | \ / | \ 2 3 4 / \ / | \ 5 6 7 8 9 / / | \ 10 11 12 13 Output: 1 2 5 10 6 11 12 13 3 4 7 8 9 Input: 3-Array Tree 1 / | \ / | \ 2 3 4 / \ / | \ 5 6 7 8 9 O 14 min read Iterative Postorder Traversal of N-ary TreeGiven an N-ary tree, the task is to find the post-order traversal of the given tree iteratively.Examples: Input: 1 / | \ 3 2 4 / \ 5 6 Output: [5, 6, 3, 2, 4, 1] Input: 1 / \ 2 3 Output: [2, 3, 1] Approach:We have already discussed iterative post-order traversal of binary tree using one stack. We wi 10 min read Level Order Traversal of N-ary TreeGiven an N-ary Tree. The task is to print the level order traversal of the tree where each level will be in a new line. Examples: Input: Image Output: 13 2 45 6Explanation: At level 1: only 1 is present.At level 2: 3, 2, 4 is presentAt level 3: 5, 6 is present Input: Image Output: 12 3 4 56 7 8 9 10 11 min read ZigZag Level Order Traversal of an N-ary TreeGiven a Generic Tree consisting of n nodes, the task is to find the ZigZag Level Order Traversal of the given tree.Note: A generic tree is a tree where each node can have zero or more children nodes. Unlike a binary tree, which has at most two children per node (left and right), a generic tree allow 8 min read Depth of an N-Ary tree Given an n-ary tree containing positive node values, the task is to find the depth of the tree.Note: An n-ary tree is a tree where each node can have zero or more children nodes. Unlike a binary tree, which has at most two children per node (left and right), the n-ary tree allows for multiple branch 5 min read Mirror of n-ary Tree Given a Tree where every node contains variable number of children, convert the tree to its mirror. Below diagram shows an example. We strongly recommend you to minimize your browser and try this yourself first. Node of tree is represented as a key and a variable sized array of children pointers. Th 9 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: 10 min read Diameter of an N-ary tree The diameter of an N-ary tree is the longest path present between any two nodes of the tree. These two nodes must be two leaf nodes. The following examples have the longest path[diameter] shaded. Example 1: Example 2: Prerequisite: Diameter of a binary tree. The path can either start from one of th 15+ min read Sum of all elements of N-ary Tree Given an n-ary tree consisting of n nodes, the task is to find the sum of all the elements in the given n-ary tree.Example:Input:Output: 268Explanation: The sum of all the nodes is 11 + 21 + 29 + 90 + 18 + 10 + 12 + 77 = 268Input:Output: 360Explanation: The sum of all the nodes is 81 + 26 + 23 + 49 5 min read Serialize and Deserialize an N-ary Tree 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 11 min read Easy problems on n-ary TreeCheck if the given n-ary tree is a binary treeGiven an n-ary tree consisting of n nodes, the task is to check whether the given tree is binary or not.Note: An n-ary tree is a tree where each node can have zero or more children nodes. Unlike a binary tree, which has at most two children per node (left and right), the n-ary tree allows for multip 6 min read Largest element in an N-ary TreeGiven an n-ary tree containing positive node values, the task is to find the node with the largest value in the given n-ary tree.Note: An n-ary tree is a tree where each node can have zero or more children nodes. Unlike a binary tree, which has at most two children per node (left and right), the n-a 5 min read Second Largest element in n-ary treeGiven an n-ary tree containing positive node values, the task is to find the node with the second largest value in the given n-ary tree. If there is no second largest node return -1.Note: An n-ary tree is a tree where each node can have zero or more children nodes. Unlike a binary tree, which has at 7 min read Number of children of given node in n-ary TreeGiven a node x, find the number of children of x(if it exists) in the given n-ary tree. Example : Input : x = 50 Output : 3 Explanation : 50 has 3 children having values 40, 100 and 20. Approach : Initialize the number of children as 0.For every node in the n-ary tree, check if its value is equal to 7 min read Number of nodes greater than a given value in n-ary treeGiven a n-ary tree and a number x, find and return the number of nodes which are greater than x. Example: In the given tree, x = 7 Number of nodes greater than x are 4. Approach: The idea is maintain a count variable initialize to 0. Traverse the tree and compare root data with x. If root data is gr 6 min read Check mirror in n-ary treeGiven two n-ary trees, determine whether they are mirror images of each other. Each tree is described by e edges, where e denotes the number of edges in both trees. Two arrays A[]and B[] are provided, where each array contains 2*e space-separated values representing the edges of both trees. Each edg 11 min read Replace every node with depth in N-ary Generic TreeGiven an array arr[] representing a Generic(N-ary) tree. The task is to replace the node data with the depth(level) of the node. Assume level of root to be 0. Array Representation: The N-ary tree is serialized in the array arr[] using level order traversal as described below:  The input is given as 15+ min read Preorder Traversal of N-ary Tree Without RecursionGiven an n-ary tree containing positive node values. The task is to print the preorder traversal without using recursion.Note: An n-ary tree is a tree where each node can have zero or more children. Unlike a binary tree, which has at most two children per node (left and right), the n-ary tree allows 6 min read Maximum value at each level in an N-ary TreeGiven a N-ary Tree consisting of nodes valued in the range [0, N - 1] and an array arr[] where each node i is associated to value arr[i], the task is to print the maximum value associated with any node at each level of the given N-ary Tree. Examples: Input: N = 8, Edges[][] = {{0, 1}, {0, 2}, {0, 3} 9 min read Replace each node in given N-ary Tree with sum of all its subtreesGiven an N-ary tree. The task is to replace the values of each node with the sum of all its subtrees and the node itself. Examples Input: 1 / | \ 2 3 4 / \ \ 5 6 7Output: Initial Pre-order Traversal: 1 2 5 6 7 3 4 Final Pre-order Traversal: 28 20 5 6 7 3 4 Explanation: Value of each node is replaced 8 min read Path from the root node to a given node in an N-ary TreeGiven an integer N and an N-ary Tree of the following form: Every node is numbered sequentially, starting from 1, till the last level, which contains the node N.The nodes at every odd level contains 2 children and nodes at every even level contains 4 children. The task is to print the path from the 10 min read Determine the count of Leaf nodes in an N-ary treeGiven the value of 'N' and 'I'. Here, I represents the number of internal nodes present in an N-ary tree and every node of the N-ary can either have N childs or zero child. The task is to determine the number of Leaf nodes in n-ary tree. Examples: Input : N = 3, I = 5 Output : Leaf nodes = 11 Input 4 min read Remove all leaf nodes from a Generic Tree or N-ary TreeGiven an n-ary tree containing positive node values, the task is to delete all the leaf nodes from the tree and print preorder traversal of the tree after performing the deletion.Note: An n-ary tree is a tree where each node can have zero or more children nodes. Unlike a binary tree, which has at mo 6 min read Maximum level sum in N-ary TreeGiven an N-ary Tree consisting of nodes valued [1, N] and an array value[], where each node i is associated with value[i], the task is to find the maximum of sum of all node values of all levels of the N-ary Tree. Examples: Input: N = 8, Edges[][2] = {{0, 1}, {0, 2}, {0, 3}, {1, 4}, {1, 5}, {3, 6}, 9 min read Number of leaf nodes in a perfect N-ary tree of height KFind the number of leaf nodes in a perfect N-ary tree of height K. Note: As the answer can be very large, return the answer modulo 109+7. Examples: Input: N = 2, K = 2Output: 4Explanation: A perfect Binary tree of height 2 has 4 leaf nodes. Input: N = 2, K = 1Output: 2Explanation: A perfect Binary t 4 min read Print all root to leaf paths of an N-ary treeGiven an N-Ary tree, the task is to print all root to leaf paths of the given N-ary Tree. Examples: Input: 1 / \ 2 3 / / \ 4 5 6 / \ 7 8 Output:1 2 41 3 51 3 6 71 3 6 8 Input: 1 / | \ 2 5 3 / \ \ 4 5 6Output:1 2 41 2 51 51 3 6 Approach: The idea to solve this problem is to start traversing the N-ary 7 min read Minimum distance between two given nodes in an N-ary treeGiven a N ary Tree consisting of N nodes, the task is to find the minimum distance from node A to node B of the tree. Examples: Input: 1 / \ 2 3 / \ / \ \4 5 6 7 8A = 4, B = 3Output: 3Explanation: The path 4->2->1->3 gives the minimum distance from A to B. Input: 1 / \ 2 3 / \ \ 6 7 8A = 6, 11 min read Average width in a N-ary treeGiven a Generic Tree consisting of N nodes, the task is to find the average width for each node present in the given tree. The average width for each node can be calculated by the ratio of the total number of nodes in that subtree(including the node itself) to the total number of levels under that n 8 min read Maximum width of an N-ary treeGiven an N-ary tree, the task is to find the maximum width of the given tree. The maximum width of a tree is the maximum of width among all levels. Examples: Input: 4 / | \ 2 3 -5 / \ /\ -1 3 -2 6 Output: 4 Explanation: Width of 0th level is 1. Width of 1st level is 3. Width of 2nd level is 4. There 9 min read Like