二叉树的遍历（Tree Traversals）参考极客

最新推荐文章于 2022-04-30 22:30:25 发布

u010969626

最新推荐文章于 2022-04-30 22:30:25 发布

阅读量434

点赞数

分类专栏：数据结构文章标签：二叉树遍历数据结构

本文链接：https://blog.csdn.net/u010969626/article/details/51613619

版权

数据结构专栏收录该内容

3 篇文章 0 订阅

订阅专栏

本文探讨了树的四种主要遍历方法：中序遍历、先序遍历、后序遍历和宽度遍历（层次遍历）。这些遍历方式是理解二叉树和数据结构基础的关键。

摘要由CSDN通过智能技术生成

树的遍历

不像线性数据结构（数组，链表，队列，栈），仅仅有一种逻辑方式遍历，树可以通过不同的方式遍历，中序遍历，先序遍历和后序遍历，宽度遍历也就是层次遍历，

// tree_tra.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
using namespace std;
struct node
{
	int data;
	struct node* left;
	struct node* right;
};

struct node* newNode(int data)  
{
	struct node* node = (struct node*)
		malloc(sizeof(struct node));
	node->data = data;
	node->left = NULL;
	node->right = NULL;

	return(node);
}
void printPostorder(struct node* node)
{
	if (node == NULL)
		return;

	
	printPostorder(node->left);

	
	printPostorder(node->right);


	printf("%d ", node->data);
}



void printInorder(struct node* node)
{
	if (node == NULL)
		return;


	printInorder(node->left);


	printf("%d ", node->data); 


	printInorder(node->right);
}

void printPreorder(struct node* node)
{
	if (node == NULL)
		return;

	printf("%d ", node->data); 

	printPreorder(node->left); 


	printPreorder(node->right);
} 

int main()
{
	struct node *root = newNode(1);
	root->left			 = newNode(2);
	root->right		 = newNode(3);
	root->left->left	 = newNode(4);
	root->left->right = newNode(5); 

	printf("\nPreorder traversal of binary tree is \n");
	printPreorder(root);

	printf("\nInorder traversal of binary tree is \n");
	printInorder(root); 

	printf("\nPostorder traversal of binary tree is \n");
	printPostorder(root);

	getchar();
	return 0;
}


int _tmain(int argc, _TCHAR* argv[])
{
	struct node *root = newNode(1);
	root->left = newNode(2);
	root->right = newNode(3);
	root->left->left = newNode(4);
	root->left->right = newNode(5);

	printf("\nPreorder traversal of binary tree is \n");
	printPreorder(root);

	printf("\nInorder traversal of binary tree is \n");
	printInorder(root);

	printf("\nPostorder traversal of binary tree is \n");
	printPostorder(root);

	getchar();






	return 0;
}