HDU-3999 The order of a Tree 树的遍历

最新推荐文章于 2021-03-14 10:44:44 发布

___Evan

最新推荐文章于 2021-03-14 10:44:44 发布

阅读量422

点赞数

分类专栏：数据结构-二叉树

本文链接：https://blog.csdn.net/u011742541/article/details/21111935

版权

数据结构-二叉树专栏收录该内容

2 篇文章 0 订阅

订阅专栏

题目链接

对指针的理解运用还欠加强

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<functional>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn =100005;
const int inf = 1<<30;//0x7f;
typedef __int64 LL;
int n;
struct node
{
	int w;
	node *lch,*rch;
};
node *updata( int u,node *root )
{
	if( root == NULL ){
		root = new node;
		root->w = u; root->lch = root->rch = NULL;
		return root;
	}
	else if( root->w > u )
		root->lch = updata( u,root->lch );
	else if( root->w < u )
		root->rch = updata( u,root->rch );
	return root;
}
void fun( node *root,int flag )
{
	if( flag )
		printf("%d",root->w);
	else
		printf(" %d",root->w);
	if( root->lch != NULL  )
		fun( root->lch,0 );
	if( root->rch != NULL )
		fun( root->rch,0 );
}
int main()
{
	#ifndef ONLINE_JUDGE
    freopen("data.txt","r",stdin);
	#endif
	int u;
	while( scanf("%d",&n) != EOF )
	{
		node *root = NULL;
		for( int i = 1; i <= n; i ++ ){
			scanf("%d",&u);
			root = updata(u,root);
		}
		fun( root,1 );
		puts("");
	}
    return 0;
}