Given an N-ary tree, find and return the node with second largest value in the given tree. Return NULL if no node with required value is present.
For example, in the given tree
Second largest node is 20.
A simple solution is to traverse the array twice. In the first traversal find the maximum value node. In the second traversal find the greatest element node less than the element obtained in first traversal. The time complexity of this solution is O(n).
An Efficient Solution can be to find the second largest element in a single traversal.
Below is the complete algorithm for doing this:
1) Initialize two nodes first and second to NULL as, first = second = NULL 2) Start traversing the tree, a) If the current node data say root->key is greater than first->key then update first and second as, second = first first = root b) If the current node data is in between first and second, then update second to store the value of current node as second = root 3) Return the node stored in second.
Second largest element 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 email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Node having maximum sum of immediate children and itself in n-ary tree
- Check if two nodes are cousins in a Binary Tree
- Next Larger element in n-ary tree
- Sub-tree with minimum color difference in a 2-coloured tree
- Print nodes at k distance from root
- HashSet vs TreeSet in Java
- Preorder from Inorder and Postorder traversals
- Count pairs in a binary tree whose sum is equal to a given value x
- Find the maximum node at a given level in a binary tree
- Print nodes in top view of Binary Tree | Set 2