前序遍歷

/*** Definition for a binary tree node.* struct TreeNode {*     int val;*     struct TreeNode *left;*     struct TreeNode *right;* };*//*** Note: The returned array must be malloced, assume caller calls free().*/
int *array;
int size;void _preorderTraversal(struct TreeNode *root){if(root == NULL){return ;}//處理根結點array[size++]=root->val;_preorderTraversal(root->left);_preorderTraversal(root->right);
}int* preorderTraversal(struct TreeNode* root, int* returnSize){array = (int *)malloc(sizeof(int)*100*1000);size =0  ;_preorderTraversal(root);*returnSize = size;return array;
}

中序遍歷

/*** Definition for a binary tree node.* struct TreeNode {*     int val;*     struct TreeNode *left;*     struct TreeNode *right;* };*//*** Note: The returned array must be malloced, assume caller calls free().*/int *array;
int size;void _preorderTraversal(struct TreeNode *root){if (root == NULL){return;}//處理根結點_preorderTraversal(root->left);array[size++] = root->val;_preorderTraversal(root->right);
}int* inorderTraversal(struct TreeNode* root, int* returnSize){array = (int *)malloc(sizeof(int)* 100 * 1000);size = 0;_preorderTraversal(root);*returnSize = size;return array;
}

后序遍歷

/*** Definition for a binary tree node.* struct TreeNode {*     int val;*     struct TreeNode *left;*     struct TreeNode *right;* };*//*** Note: The returned array must be malloced, assume caller calls free().*/int *array;
int size;void _preorderTraversal(struct TreeNode *root){if (root == NULL){return;}//處理根結點_preorderTraversal(root->left);_preorderTraversal(root->right);array[size++] = root->val;
}
int* postorderTraversal(struct TreeNode* root, int* returnSize){array = (int *)malloc(sizeof(int)* 100 * 1000);size = 0;_preorderTraversal(root);*returnSize = size;return array;
}