Leetcode 144. 二叉树的前序遍历

144. 二叉树的前序遍历

给你二叉树的根节点 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]

提示：

树中节点数目在范围 [0, 100] 内
-100 <= Node.val <= 100

代码

递归

/**
 * 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().
 */
void preOrder(struct TreeNode* root, int* res, int* returnSize) {
    if (root == NULL) //根节点为空，之间返回
        return;
    res[(*returnSize)++] = root->val;//中
    preOrder(root->left, res, returnSize);//左
    preOrder(root->right, res, returnSize);//右
}

int* preorderTraversal(struct TreeNode* root, int* returnSize){
    int* res = (int*)malloc(sizeof(int) * 100);
    *returnSize = 0;
    preOrder(root, res, returnSize);
    return res;
}

迭代

/**
 * 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* preorderTraversal(struct TreeNode* root, int* returnSize){
    int* res = (int*)malloc(sizeof(int) * 100);
    *returnSize = 0;
    if (root == NULL) {	//根节点为空，树空，直接返回
        return res;
    }

    struct TreeNode* tree[100];
    int top = 0;
    tree[top++] = root;
    while (top > 0) {	//树不空
        struct TreeNode* tt = tree[--top];//根节点出栈
        res[(*returnSize)++] = tt->val;//中
        if (tt->right){//右节点先入栈，可以保证左节点先出栈
            tree[top++] = tt->right;
        }
        if (tt->left) {
            tree[top++] = tt->left;
        }
    }
    return res;
}