# Next Larger element in n-ary tree

Given a generic tree and a integer x. Find and return the node with next larger element in the tree i.e. find a node just greater than x. Return NULL if no node is present with value greater than x.

For example, in the given tree x = 10, just greater node value is 12

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

The idea is maintain a node pointer res, which will contain the final resultant node.
Traverse the tree and check if root data is greater than x. If so, then compare the root data with res data.
If root data is greater than n and less than res data update res.

 `// CPP program to find next larger element ` `// in an n-ary tree. ` `#include ` `using` `namespace` `std; ` ` `  `// Structure of a node of an n-ary tree ` `struct` `Node { ` `    ``int` `key; ` `    ``vector child; ` `}; ` ` `  `// Utility function to create a new tree node ` `Node* newNode(``int` `key) ` `{ ` `    ``Node* temp = ``new` `Node; ` `    ``temp->key = key; ` `    ``return` `temp; ` `} ` ` `  `void` `nextLargerElementUtil(Node* root, ``int` `x, Node** res) ` `{ ` `    ``if` `(root == NULL) ` `        ``return``; ` ` `  `    ``// if root is less than res but greater than  ` `    ``// x update res ` `    ``if` `(root->key > x)  ` `        ``if` `(!(*res) || (*res)->key > root->key) ` `            ``*res = root;     ` ` `  `    ``// Number of children of root ` `    ``int` `numChildren = root->child.size(); ` ` `  `    ``// Recur calling for every child ` `    ``for` `(``int` `i = 0; i < numChildren; i++) ` `        ``nextLargerElementUtil(root->child[i], x, res); ` ` `  `    ``return``; ` `} ` ` `  `// Function to find next Greater element of x in tree ` `Node* nextLargerElement(Node* root, ``int` `x) ` `{ ` `    ``// resultant node ` `    ``Node* res = NULL; ` ` `  `    ``// calling helper function ` `    ``nextLargerElementUtil(root, x, &res); ` ` `  `    ``return` `res; ` `} ` ` `  `// Driver program ` `int` `main() ` `{ ` `    ``/*   Let us create below tree ` `   ``*             5 ` `   ``*         /   |  \ ` `   ``*         1   2   3 ` `   ``*        /   / \   \ ` `   ``*       15  4   5   6 ` `   ``*/` ` `  `    ``Node* root = newNode(5); ` `    ``(root->child).push_back(newNode(1)); ` `    ``(root->child).push_back(newNode(2)); ` `    ``(root->child).push_back(newNode(3)); ` `    ``(root->child->child).push_back(newNode(15)); ` `    ``(root->child->child).push_back(newNode(4)); ` `    ``(root->child->child).push_back(newNode(5)); ` `    ``(root->child->child).push_back(newNode(6)); ` ` `  `    ``int` `x = 5; ` ` `  `    ``cout << ``"Next larger element of "` `<< x << ``" is "``; ` `    ``cout << nextLargerElement(root, x)->key << endl; ` ` `  `    ``return` `0; ` `} `

Output:

```Next larger element of 5 is 6
```

This article is contributed by Chhavi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

My Personal Notes arrow_drop_up

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.