Time: 40 ms (27.26%), Space: 62.4 MB (80.65%) - LeetHub

py3-coder · py3-coder · commit e0d3fca0cb32 · 2024-10-22T23:14:19.000+05:30
diff --git a/2583-kth-largest-sum-in-a-binary-tree/2583-kth-largest-sum-in-a-binary-tree.java b/2583-kth-largest-sum-in-a-binary-tree/2583-kth-largest-sum-in-a-binary-tree.java
@@ -0,0 +1,38 @@
+/**
+ * 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 long kthLargestLevelSum(TreeNode root, int k) {
+        List<Long> list=new ArrayList<>();
+        Queue<TreeNode> qu=new LinkedList<>();
+        qu.offer(root);
+        while(!qu.isEmpty())
+        {
+            int p=qu.size();
+            long s=0;
+            for(int i=0;i<p;i++)
+            {
+                if(qu.peek().left!=null)
+                    qu.offer(qu.peek().left);
+                if(qu.peek().right!=null)
+                    qu.offer(qu.peek().right);
+                s+=(long)qu.poll().val;
+            }
+            list.add(s);
+        }
+        Collections.sort(list);
+        return k > list.size() ? -1 : list.get(list.size()-k);
+    }
+}
