From 8a827a9a62edbd2fcc63e543dfd5839a19dfb294 Mon Sep 17 00:00:00 2001
From: ErukulaRajasree <121875669+ErukulaRajasree@users.noreply.github.com>
Date: Fri, 6 Oct 2023 23:06:30 +0530
Subject: [PATCH] Create Largestvalueineachtreerow.cpp

Add Find largest value in each tree row (Leetcode 515)
---
 .../Findlargestvalueineachtreerow.cpp         | 29 +++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 LEETCODE SOLUTIONS/Findlargestvalueineachtreerow.cpp

diff --git a/LEETCODE SOLUTIONS/Findlargestvalueineachtreerow.cpp b/LEETCODE SOLUTIONS/Findlargestvalueineachtreerow.cpp
new file mode 100644
index 0000000..59298e8
--- /dev/null
+++ b/LEETCODE SOLUTIONS/Findlargestvalueineachtreerow.cpp	
@@ -0,0 +1,29 @@
+class Solution {
+public:
+    vector<int> largestValues(TreeNode* root) {
+         queue<TreeNode*>q;
+        vector<int>v;
+        if(root!=NULL)
+            q.push(root);
+        while(!q.empty())
+        {
+            int k=q.size();
+            vector<int>g;
+            for(int i=0;i<k;i++)
+            {
+                TreeNode* node=q.front();
+                if(node->left!=NULL)
+                    q.push(node->left);
+                if(node->right!=NULL)
+                    q.push(node->right);
+                g.push_back(node->val);
+                q.pop();
+            }
+            // if(g.size()>0)
+            //     v.push_back(g);
+            int m=*max_element(g.begin(),g.end());
+            v.push_back(m);
+        }
+        return v;
+    }
+};