题目来源:力扣https://leetcode.cn/problems/binary-tree-preorder-traversal/题目简介:
给定二叉树的根节点root,返回它的前序遍历
思路:
递归
代码实现:
void preorder(struct TreeNode* root, int* res, int* resSize) {
if (root == NULL) {
return;
}
res[(*resSize)++] = root->val;
preorder(root->left, res, resSize);
preorder(root->right, res, resSize);
}
int* preorderTraversal(struct TreeNode* root, int* returnSize) {
int* res = malloc(sizeof(int) * 2000);//动态分配空间
*returnSize = 0;
preorder(root, res, returnSize);
return res;
}