中序遍历二叉排序树：BinarySearchTree:Create a tree and InorderTree

// BinaryTree.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "iostream"
using namespace std;

typedef struct _node
{
 struct _node* lch;
 struct _node* rch;
 int data;
}Node;
  Node* InsertNode(Node* cur,int data)
{
if(cur)
{
 if(data>cur->data)
  cur->rch=InsertNode(cur->rch,data);
 else cur->lch=InsertNode(cur->lch,data);
}
else
{
 cur=(Node*)malloc(sizeof(Node));
cur->data=data;
cur->lch=NULL;
cur->rch=NULL;
}
return cur;
}

void InorderTree(Node* root)
{
 if(root)
 {
  InorderTree(root->lch);
  cout<<root->data<< " ";
  InorderTree(root->rch);
 }
}
int _tmain(int argc, _TCHAR* argv[])
{
 int arr[9]={12,78,3,23,51,78,89,2,1};
 Node* head=(Node*)malloc(sizeof(Node));
 head->data=arr[0];
 head->lch=NULL;
 head->rch=NULL;

 for(int i=1;i<9;i++)
 InsertNode(head,arr[i]);
 InorderTree(head);
 cin.get();
 return 0;
}