leetcode 二叉树的前序中序后序遍历_输入一棵二叉树的先序和中序遍历序列,输出其后序遍历序列。-优快云博客

本文链接：https://blog.youkuaiyun.com/t800pro/article/details/80982266

本文详细介绍了二叉树的三种基本遍历方法：前序遍历、中序遍历和后序遍历，并通过C语言实现了每种遍历方式的具体代码示例。

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

给定一个二叉树

示例:

输入: [1,null,2,3]  
   1
    \
     2
    /
   3 

输出: [1,2,3]

前序遍历

#include <stdio.h>

struct node {
    struct node *left;
    struct node *right;
    int val;
};

void PreOrderTraversal(struct node *root) {
    if (root == NULL) {
        return;
    }
    printf("%d\n", root->val);
    PreOrderTraversal(root->left);
    PreOrderTraversal(root->right);
}

int main() {
    struct node a, b, c;
    a.val = 1;
    b.val = 2;
    c.val = 3;
	a.left = NULL;
	a.right = &b;
	b.right = NULL;
	b.left = &c;
	c.left = c.right = NULL;
    PreOrderTraversal(&a);
}

中序遍历

#include <stdio.h>

struct node {
    struct node *left;
    struct node *right;
    int val;
};

void InOrderTraversal(struct node *root) {
    if (root == NULL) {
        return;
    }
    InOrderTraversal(root->left);
    printf("%d\n", root->val);
    InOrderTraversal(root->right);
}

int main() {
    struct node a, b, c;
    a.val = 1;
    b.val = 2;
    c.val = 3;
	a.left = NULL;
	a.right = &b;
	b.right = NULL;
	b.left = &c;
	c.left = c.right = NULL;

    InOrderTraversal(&a);
}

后序遍历

#include <stdio.h>

struct node {
    struct node *left;
    struct node *right;
    int val;
};

void PostOrderTraversal(struct node *root) {
    if (root == NULL) {
        return;
    }
    PostOrderTraversal(root->left);
    PostOrderTraversal(root->right);
    printf("%d\n", root->val);
}

int main() {
    struct node a, b, c;
    a.val = 1;
    b.val = 2;
    c.val = 3;
	a.left = NULL;
	a.right = &b;
	b.right = NULL;
	b.left = &c;
	c.left = c.right = NULL;

    PostOrderTraversal(&a);
}