Initial commit

Easy/binary-tree-inorder-traversal/solution.cpp

@@ -0,0 +1,31 @@
+#include <vector>
+
+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 {
+  private:
+    void traverse(std::vector<int> &list, TreeNode *root) {
+        if (root == nullptr) {
+            return;
+        } else {
+            traverse(list, root->left);
+            list.push_back(root->val);
+            traverse(list, root->right);
+        }
+    }
+
+  public:
+    std::vector<int> inorderTraversal(TreeNode *root) {
+        std::vector<int> list;
+        traverse(list, root);
+        return list;
+    }
+};