100 new algo added.

liuyubobobo · liuyubobobo · commit ec5cf739f27b · 2018-10-16T16:03:26.000-07:00
diff --git a/0100-Same-Tree/cpp-0100/main.cpp b/0100-Same-Tree/cpp-0100/main.cpp
@@ -7,7 +7,7 @@
 using namespace std;
 
 
-/// Recursion
+/// Using a string to represent a Binary Tree in preorder
 /// Time Complexity: O(n)
 /// Space Complexity: O(h)
 
@@ -23,10 +23,26 @@ class Solution {
 public:
     bool isSameTree(TreeNode* p, TreeNode* q) {
 
-        if(!p && !q) return true;
-        if(!p || !q) return false;
-        if(p->val != q->val) return false;
-        return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
+        string ps = "#";
+        getTreeString(p, ps);
+
+        string qs = "#";
+        getTreeString(q, qs);
+
+        return ps == qs;
+    }
+
+private:
+    void getTreeString(TreeNode* node, string& s){
+
+        if(!node){
+            s += "NULL#";
+            return;
+        }
+
+        s += to_string(node->val) + "#";
+        getTreeString(node->left, s);
+        getTreeString(node->right, s);
     }
 };
 
diff --git a/0100-Same-Tree/cpp-0100/main2.cpp b/0100-Same-Tree/cpp-0100/main2.cpp
@@ -0,0 +1,37 @@
+/// Source : https://leetcode.com/problems/same-tree/description/
+/// Author : liuyubobobo
+/// Time   : 2018-10-16
+
+#include <iostream>
+
+using namespace std;
+
+
+/// Recursion
+/// Time Complexity: O(n)
+/// Space Complexity: O(h)
+
+/// Definition for a binary tree node.
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+};
+
+class Solution {
+public:
+    bool isSameTree(TreeNode* p, TreeNode* q) {
+
+        if(!p && !q) return true;
+        if(!p || !q) return false;
+        if(p->val != q->val) return false;
+        return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
