Time: 8 ms (98.72%), Space: 23.5 MB (90.89%) - LeetHub

Author: JanaSabuj

construct-string-from-binary-tree/construct-string-from-binary-tree.cpp

@@ -0,0 +1,38 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+    string str;
+public:
+    void dfs(TreeNode* t){
+        if(t == NULL)
+            return;
+        
+        str += to_string(t->val);
+        
+        if(t->left or t->right){
+            str += "(";
+            dfs(t->left);
+            str += ")";
+        }
+        
+        if(t->right){
+            str += "(";
+            dfs(t->right);
+            str += ")";
+        }
+        
+    }
+    string tree2str(TreeNode* t) {
+        dfs(t);
+        return str;
+    }
+};