題目地址：http://acm.hdu.edu.cn/showproblem.php?pid=3999

本題為簡單二叉排序樹，先按排序樹創(chuàng)建樹，然后先序遍歷二叉樹，輸出的時(shí)候最后一個(gè)數(shù)字后面沒有空格。

數(shù)組實(shí)現(xiàn)：

?

#include<stdio.h> #include<string.h> #define N 100005 int tree[N],left[N],right[N],a[N],num,flg;//tree數(shù)組用來保存樹節(jié)點(diǎn)的值，left，right數(shù)組用來保存結(jié)點(diǎn)的左右子樹， void insert(int index,int x) {if( x <= tree[index] )//當(dāng)根結(jié)點(diǎn)比x的值大 的時(shí)候。{if(left[index] == -1)//當(dāng)根結(jié)點(diǎn)左子樹為空的時(shí)候。left[index] = flg;elseinsert(left[index],x);//左子樹不為空時(shí)繼續(xù)遍歷左子樹}else{if(right[index] == -1)//當(dāng)右子樹為空時(shí)right[index] = flg;elseinsert(right[index],x);//當(dāng)右子樹不為空的時(shí)候} } void PreOrderTraverse(int index)//先序遍歷二叉排序樹 {a[num++] = tree[index];if(left[index] != -1)PreOrderTraverse(left[index]);if(right[index] != -1)PreOrderTraverse(right[index]); } int main() {int n,i,x,root;while(~scanf("%d",&n)){//初始化樹的所有結(jié)點(diǎn)都為空。memset(left,-1,sizeof(left));memset(right,-1,sizeof(right));root = -1;flg = 0;for(i = 0; i< n; i++){scanf("%d",&x);if(root == -1)tree[++root] = x;else{tree[++flg] = x;insert(root,x);}}num = 0;PreOrderTraverse(root);printf("%d",a[0]);for(i = 1; i <= n -1; i++)printf(" %d",a[i]);printf("\n");}return 0; }

?

動(dòng)態(tài)創(chuàng)建二叉樹排序樹

?

#include<stdio.h> #include<stdlib.h> struct node {int data;struct node *left;struct node *right; }; int b[100005],num,n; void delete_tree(node *t) {if(t->left)delete_tree(t->left);if(t->right)delete_tree(t->left);free(t); } node* insert(node *t,int x) {if(t){if(x < t->data)t->left = insert(t->left,x);elset->right = insert(t->right,x);}else{t = (node*)malloc(sizeof(node));t->data = x;t->left = t->right = NULL;}return t; } void PreOrderTraverse(node *t) {if(t == NULL)return ;b[num++] = t->data;PreOrderTraverse(t->left);PreOrderTraverse(t->right);free(t); } node *create(node *t) {int i,x;for(i = 0; i < n; i++){scanf("%d",&x);t = insert(t,x);}return t; } int main() {int i;node *root;while(~scanf("%d",&n)){root = NULL;root = create(root);num = 0;PreOrderTraverse(root);printf("%d",b[0]);for(i = 1; i < n; i++)printf(" %d",b[i]);printf("\n");}return 0; }

?

?

轉(zhuǎn)載于:https://www.cnblogs.com/LUO257316/archive/2012/08/30/3220835.html

總結(jié)

以上是生活随笔為你收集整理的hdu 3999The order of a Tree的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。