Direct on Dry Goods:
#include "Targetver.h" using namespace std;//define node struct binode{int data; Binode * LCHILD; Binode * rchild;};/ /Insert Node Binode * INSERTBST (Binode * root,int data) {if (root==null) {root=new Binode;root->data=data;root->lchild = Root->rchild =null;} if (root->data >data) Root->lchild = Insertbst (root->lchild, data); if (Root->data <data) root-> Rchild = Insertbst (root->rchild, data); return root;} Create two fork Tree Binode * CREATEBST (Binode * root,int data[],int N) {int i;for (i=0;i<n;i++) root = Insertbst (Root,data[i]); return root;} First Order search binary tree void Printbst (Binode * root) {if (root!=null) {cout<<root->data<< "--"; Printbst (Root->lchild); Printbst (Root->rchild);}} int main (int argc, char* *argv) {Binode * root=null;int data[10]={5,9,4,7,3,6,1,8,2,10};root=createbst (root,data,10); Printbst (root); Cout<<endl;return 0;}
Results (VS2010):
C + + generates two fork trees and searches