Time: 2 ms (83.77%), Space: 45.5 MB (48.25%) - LeetHub

py3-coder · py3-coder · commit e23ce6f0512d · 2024-12-25T20:53:07.000+05:30
diff --git a/0515-find-largest-value-in-each-tree-row/0515-find-largest-value-in-each-tree-row.java b/0515-find-largest-value-in-each-tree-row/0515-find-largest-value-in-each-tree-row.java
@@ -0,0 +1,36 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+     public List<Integer> largestValues(TreeNode root) {
+        Queue<TreeNode> queue = new LinkedList<TreeNode>();
+        List<Integer> res = new ArrayList<Integer>();
+        queue.add(root);
+        int queueSize = root == null ? 0 : 1;
+        while (queueSize > 0) {
+            int largestElement = Integer.MIN_VALUE;
+            for (int i=0;i<queueSize;i++) {
+                TreeNode cur = queue.poll();
+                largestElement = Math.max(cur.val, largestElement);
+                if (cur.left != null) queue.add(cur.left);
+                if (cur.right != null) queue.add(cur.right);
+            }
+            res.add(largestElement);
+            queueSize = queue.size();
+        }
+       
+        return res;
+    }
+}
