We have a simple binary tree and we have to print the top 3 largest elements present in the binary tree.
Examples:
Input :
1
/ \
2 3
/ \ / \
4 5 4 5
Output :Three largest elements are 5 4 3
Approach We can simply take three variables first, second, third to store the first largest, second largest, third largest respectively and perform preorder traversal and each time we will update the elements accordingly.
This approach will take O(n) time only.
Algorithm-
1- Take 3 variables first, second, third
2- Perform a preorder traversal
if (root==NULL)
return
if root's data is larger then first
update third with second
second with first
first with root's data
else if root's data is larger then
second and not equal to first
update third with second
second with root's data
else if root's data is larger then
third and not equal to first &
second
update third with root's data
3- call preorder for root->left
4- call preorder for root->right
C++
// CPP program to find largest three elements in // a binary tree. #include <bits/stdc++.h> using namespace std; struct Node { int data; struct Node *left; struct Node *right; }; /* Helper function that allocates a new Node with the given data and NULL left and right pointers. */struct Node *newNode(int data) { struct Node *node = new Node; node->data = data; node->left = NULL; node->right = NULL; return (node); } // function to find three largest element void threelargest(Node *root, int &first, int &second, int &third) { if (root == NULL) return; // if data is greater than first large number // update the top three list if (root->data > first) { third = second; second = first; first = root->data; } // if data is greater than second large number // and not equal to first update the bottom // two list else if (root->data > second && root->data != first) { third = second; second = root->data; } // if data is greater than third large number // and not equal to first & second update the // third highest list else if (root->data > third && root->data != first && root->data != second) third = root->data; threelargest(root->left, first, second, third); threelargest(root->right, first, second, third); } // driver function int main() { struct Node *root = newNode(1); root->left = newNode(2); root->right = newNode(3); root->left->left = newNode(4); root->left->right = newNode(5); root->right->left = newNode(4); root->right->right = newNode(5); int first = 0, second = 0, third = 0; threelargest(root, first, second, third); cout << "three largest elements are " << first << " " << second << " " << third; return 0; } |
chevron_right
filter_none
Java
// Java program to find largest three elements // in a binary tree. import java.util.*; class GFG { static class Node { int data; Node left; Node right; }; static int first, second, third; /* Helper function that allocates a new Node with the given data and null left and right pointers. */static Node newNode(int data) { Node node = new Node(); node.data = data; node.left = null; node.right = null; return (node); } // function to find three largest element static void threelargest(Node root) { if (root == null) return; // if data is greater than first large number // update the top three list if (root.data > first) { third = second; second = first; first = root.data; } // if data is greater than second large number // and not equal to first update the bottom // two list else if (root.data > second && root.data != first) { third = second; second = root.data; } // if data is greater than third large number // and not equal to first & second update the // third highest list else if (root.data > third && root.data != first && root.data != second) third = root.data; threelargest(root.left); threelargest(root.right); } // driver function public static void main(String[] args) { Node root = newNode(1); root.left = newNode(2); root.right = newNode(3); root.left.left = newNode(4); root.left.right = newNode(5); root.right.left = newNode(4); root.right.right = newNode(5); first = 0; second = 0; third = 0; threelargest(root); System.out.print("three largest elements are " + first + " " + second + " " + third); } } // This code is contributed by PrinciRaj1992 |
chevron_right
filter_none
Python3
# Python3 program to find largest three # elements in a binary tree. # Helper function that allocates a new # Node with the given data and None # left and right pointers. class newNode: def __init__(self, data): self.data = data self.left = None self.right = None # function to find three largest element def threelargest(root, first, second, third): if (root == None): return # if data is greater than first large # number update the top three list if (root.data > first[0]): third[0] = second[0] second[0] = first[0] first[0] = root.data # if data is greater than second large # number and not equal to first update # the bottom two list elif (root.data > second[0] and root.data != first[0]): third[0] = second[0] second[0] = root.data # if data is greater than third large # number and not equal to first & second # update the third highest list elif (root.data > third[0] and root.data != first[0] and root.data != second[0]): third[0] = root.data threelargest(root.left, first, second, third) threelargest(root.right, first, second, third) # Driver Code if __name__ == '__main__': root = newNode(1) root.left = newNode(2) root.right = newNode(3) root.left.left = newNode(4) root.left.right = newNode(5) root.right.left = newNode(4) root.right.right = newNode(5) first = [0] second = [0] third = [0] threelargest(root, first, second, third) print("three largest elements are", first[0], second[0], third[0]) # This code is contributed by PranchalK |
chevron_right
filter_none
C#
// C# program to find largest three elements // in a binary tree. using System; class GFG { public class Node { public int data; public Node left; public Node right; }; static int first, second, third; /* Helper function that allocates a new Node with the given data and null left and right pointers. */static Node newNode(int data) { Node node = new Node(); node.data = data; node.left = null; node.right = null; return (node); } // function to find three largest element static void threelargest(Node root) { if (root == null) return; // if data is greater than first large number // update the top three list if (root.data > first) { third = second; second = first; first = root.data; } // if data is greater than second large number // and not equal to first update the bottom // two list else if (root.data > second && root.data != first) { third = second; second = root.data; } // if data is greater than third large number // and not equal to first & second update the // third highest list else if (root.data > third && root.data != first && root.data != second) third = root.data; threelargest(root.left); threelargest(root.right); } // Driver Code public static void Main(String[] args) { Node root = newNode(1); root.left = newNode(2); root.right = newNode(3); root.left.left = newNode(4); root.left.right = newNode(5); root.right.left = newNode(4); root.right.right = newNode(5); first = 0; second = 0; third = 0; threelargest(root); Console.WriteLine("three largest elements are " + first + " " + second + " " + third); } } // This code is contributed by 29AjayKumar |
chevron_right
filter_none
Output:
three largest elements are 5 4 3
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Find the largest three elements in an array
- Order statistic tree using fenwick tree (BIT)
- Find top k (or most frequent) numbers in a stream
- Find all elements in array which have at-least two greater elements
- Average of remaining elements after removing K largest and K smallest elements from array
- k largest(or smallest) elements in an array | added Min Heap method
- Sum of k smallest elements in BST
- k-th smallest absolute difference of two elements in an array
- Maximum difference between group of k-elements and rest of the array.
- Minimum number of elements to add to make median equals x
- k smallest elements in same order using O(1) extra space
- Kth smallest or largest element in unsorted Array | Set 4
- QuickSelect (A Simple Iterative Implementation)
- Find the K-th minimum element from an array concatenated M times
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.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
