leetcode二叉树遍历总结

最新推荐文章于 2025-04-08 09:24:53 发布

又菜又爱玩呜呜呜~

最新推荐文章于 2025-04-08 09:24:53 发布

阅读量91

点赞数 1

分类专栏：文章

本文链接：https://blog.youkuaiyun.com/biancheng4/article/details/117530229

版权

文章专栏收录该内容

8 篇文章

订阅专栏

博客介绍了递归实现二叉树遍历的方法，包括先序遍历，即先访问根节点，再遍历左右子树；中序遍历，按左子树、根节点、右子树的顺序；后续遍历，按左子树、右子树、根节点的顺序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

递归实现二叉树的遍历

先序便利；

先访问根节点，然后前序遍历左子树，再前序遍历右子树

struct TreeNode {
     int val;
      struct TreeNode *left;
      struct TreeNode *right;
  };
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;
}

中序遍历；

按照访问左子树——根节点——右子树的方式遍历这棵树

struct TreeNode {
     int val;
      struct TreeNode *left;
      struct TreeNode *right;
  };
void preorder(struct TreeNode* root, int* res, int* resSize) {
    if (root == NULL) {
        return;
    }
    preorder(root->left, res, resSize);
    res[(*resSize)++] = root->val;
    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;
}

###后续遍历
按照访问左子树——右子树——根节点的方式遍历这棵树

struct TreeNode {
     int val;
      struct TreeNode *left;
      struct TreeNode *right;
  };
void preorder(struct TreeNode* root, int* res, int* resSize) {
    if (root == NULL) {
        return;
    }
    preorder(root->left, res, resSize);
    preorder(root->right, res, resSize);
    res[(*resSize)++] = root->val;
}

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