Sync LeetCode submission - Binary Tree Inorder Traversal (c)

Author: JMoogs

problems/binary_tree_inorder_traversal/solution.c

@@ -1,41 +1,24 @@
+int* traverse(struct TreeNode* node, int* store) {
+	if (node->left) {
+		store = traverse(node->left, store);
+	}
+	*store = node->val;
+	++store;
+	if (node->right) {
+		store = traverse(node->right, store);
+	}
+	return store;
+}
 
-
-#include <stdio.h>
-
-// struct TreeNode {
-//      int val;
-//      struct TreeNode *left;
-//      struct TreeNode *right;
-// };
-
-typedef struct TreeNode TreeNode;
-
-
-void traverse(TreeNode* tree, int* nums, int* returnSize) {
-
-
-    if (tree->left) {
-        traverse(tree->left, nums, returnSize);
-        
-    };
-
-    // Add one after adding the value in the current tree.
-    nums[(*returnSize)++]=tree->val;
-
-    if (tree->right) {
-        traverse(tree->right, nums, returnSize);
-    }
+int* inorderTraversal(struct TreeNode* root, int* returnSize) {
+	int* arr = malloc(sizeof(int) * 100);
+	if (root) {
+		int* arr_end = traverse(root, arr);
+		*returnSize = (arr_end - arr);
+		return arr;
+	} else {
+		*returnSize = 0;
+		return 0;
+	}
 
 }
-
-int* inorderTraversal(struct TreeNode* root, int* returnSize){
-    int* nums = (int*) malloc(100*sizeof(int));
-    *returnSize = 0;
-    
-    if (root) {
-        traverse(root, nums, returnSize);
-    }
-    
-    nums = realloc(nums, sizeof(int) * (*returnSize));
-    return nums;
-}