Larger value in Each level of BST (#134)

* cpp folder in cpp

* comiti

* as

* Largestvalue in each level BST

* Largest value in each level of BST

* large Value in each level BST

Author: cinderellaman1

Diff for: .vscode/settings.json

@@ -0,0 +1,7 @@
+{
+    "files.associations": {
+        "deque": "cpp",
+        "vector": "cpp",
+        "xstring": "cpp"
+    }
+}

Diff for: C++/2235. Add Two Integers.cpp renamed to C++/Addtwoints.cpp

@@ -1,7 +1,6 @@
 class Solution {
 public:
     int sum(int num1, int num2) {
-     return num1 + num2;
-        
+     return num1 + num2;      
     }
 };

Diff for: C++/largest-rectangle-in-histogram.cpp

@@ -1,7 +1,8 @@
 // Name: Sumit Chakraborty
 
 // Username: chakraborty9569
-
+#include<vector>
+#include<stack>
 class Solution {
 public:
     int largestRectangleArea(vector<int>& heights) {

Diff for: C++/largevaluesineachlevelbst.cpp

@@ -0,0 +1,33 @@
+/*Finding largest value in each level of a BST*/
+
+class Solution{
+    public:
+    vector<int>largestvalueineachlevel(TreeNode*root){
+        if(root == NULL)
+            return {};
+        vector<int>max_vals;
+        int size;
+        int max;
+        TreeNode*temp;
+        queue<TreeNode*>q;
+        q.push(root);
+        while(!q.empty()){
+            size = q.size();
+            max = INT_MIN;
+            while(size--){
+                temp = q.front();
+                q.pop();
+                max = max(max, temp->val);
+                if(temp->left)
+                    q.push(temp->left);
+                if(temp->right){
+                    q.push(temp->right);
+                }
+            max_vals.push_back(max);
+            }
+        }
+        return max_vals;
+
+    }
+
+};

Diff for: Python/129.SumRootToLeafNumber.py

@@ -1,9 +1,4 @@
-# Definition for a binary tree node.
-# class TreeNode:
-#     def __init__(self, val=0, left=None, right=None):
-#         self.val = val
-#         self.left = left
-#         self.right = right
+
 class Solution:
     def sumNumbers(self, root: Optional[TreeNode]) -> int:
         def dfs(node, current):