Modify suffix.

Author: iphkwan

Balanced_Binary_Tree.cc

@@ -0,0 +1,39 @@
+/**
+ * Definition for binary tree
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    bool judge(TreeNode *root, int &depth) {
+        if (root == NULL) {
+            depth = 0;
+            return true;
+        }
+        int leftHeight, rightHeight;
+        if (judge(root->left, leftHeight) && judge(root->right, rightHeight)) {
+            if (leftHeight > rightHeight + 1 || rightHeight > leftHeight + 1)
+                return false;
+            if (leftHeight > rightHeight) {
+                depth = leftHeight + 1;
+            } else {
+                depth = rightHeight + 1;
+            }
+            return true;
+        }
+        return false;
+    }
+    bool isBalanced(TreeNode *root) {
+        // Start typing your C/C++ solution below
+        // DO NOT write int main() function
+        if (root == NULL) {
+            return true;
+        }
+        int tmp = 0;
+        return judge(root, tmp);
+    }
+};

Binary_Tree_Level_Order_Traversal_II.cc

@@ -0,0 +1,56 @@
+/**
+ * Definition for binary tree
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    vector<vector<int> > levelOrderBottom(TreeNode *root) {
+        // Start typing your C/C++ solution below
+        // DO NOT write int main() function
+        stack<vector<int> > st;
+        vector<vector<int> > ans;
+        if (root == NULL) {
+            return ans;
+        }
+        vector<int> tmp;
+        queue<TreeNode *> q;
+        queue<int> dep_que;
+        TreeNode *cntNode;
+        int minDepth = 1, cntDepth;
+        q.push(root);
+        dep_que.push(1);
+        while (!q.empty()) {
+            cntNode = q.front();
+            q.pop();
+            cntDepth = dep_que.front();
+            dep_que.pop();
+            if (cntDepth > minDepth) {
+                st.push(tmp);
+                tmp.clear();
+                minDepth = cntDepth;
+            }
+            tmp.push_back(cntNode->val);
+            if (cntNode->left) {
+                q.push(cntNode->left);
+                dep_que.push(cntDepth + 1);
+            }
+            if (cntNode->right) {
+                q.push(cntNode->right);
+                dep_que.push(cntDepth + 1);
+            }
+        }
+        if (tmp.size() > 0) {
+            ans.push_back(tmp);
+        }
+        while (!st.empty()) {
+            ans.push_back(st.top());
+            st.pop();
+        }
+        return ans;
+    }
+};