题目:
给你二叉树的根节点 root ,返回它节点值的 前序 遍历。
示例 1:
输入:root = [1,null,2,3]
输出:[1,2,3]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [1]
输出:[1]
示例 4:
输入:root = [1,2]
输出:[1,2]
示例 5:
输入:root = [1,null,2]
输出:[1,2]
来源:力扣(LeetCode)
链接:力扣
题解
C:
int* preorderTraversal(struct TreeNode* root, int* returnSize){
int* res = malloc(sizeof(int) * 501);
*returnSize = 0;
if (!root) {
return res;
}
struct TreeNode *stk[501];
int top = -1;
while (top >= 0 || root) {
while (root) {
res[(*returnSize)++] = root->val;
stk[++top] = root;
root = root->left;
}
root = stk[top--];
root = root->right;
}
return res;
}