well ,i get what you said and did this accordingly...but without results
please enlighten @tabstop
Code:
#include <iostream>#include <conio.h>
using namespace std;
class Node//BST node
{
friend class BST;
private:
int Data;
Node *L;
Node *R;
};
class BST
{
private:
Node *Start;
public:
BST()
{Start=NULL;}
void insertNode(Node *Head,int X);
void inorder(Node *Head);
void letInsert(int X);
void letInorder();
// void Display()
// {
// cout<<(Start->R)->Data<<endl;
// }
};
void BST::letInsert(int X)
{
insertNode(Start,X);
}
void BST::letInorder()
{
inorder(Start);
}
void BST::insertNode(Node *Head,int X)
{
if(Head==NULL)
{
Node *New=new Node;
New->Data=X;
New->L=NULL;
New->R=NULL;
Head=New;
return;
}
else if(X<Start->Data)
{
Head=Head->L;
BST::insertNode(Head,X);
}
else
{
Head=Head->R;
BST::insertNode(Head,X);
}
}
void BST::inorder(Node *Head)
{
if(Start!=NULL)
{
BST::inorder(Head->L);
cout<<Head->Data<<endl;
BST::inorder(Head->R);
}
else
return;
}
int main()
{
BST T;
T.letInsert(3);
T.letInsert(5);
//T.Display();
T.letInsert(65);
T.letInsert(32);
T.letInsert(12);
T.letInorder();
getch();
return 0;
}