二叉树

 

#include "stdafx.h"
#include<iostream>
using namespace std;
typedef struct node * tree;
struct node
{
int number;
tree left;
tree right;
};

tree createTree();
void travelTree(tree );

int main()
{
tree root;
root=createTree();
travelTree(root);
return 0;
}

tree createTree()
{
int n;
tree root;
root=(tree)malloc(sizeof(struct node));
if(root==NULL) exit(1);
printf("intput a number :");
scanf("%d",&n);
if(n==-1)
{
  return NULL;
}
else
{
  root->number=n;
  root->left=createTree();
  root->right=createTree();;
}
return root;
}

void travelTree(tree r)
{
if(r!=NULL)
{
  printf("%d  ",r->number);
  travelTree(r->left);
  travelTree(r->right);//此处按先序遍历
}
}