Write a C++ integer binary search tree program that will insert nodes, delete no

Question

Write a C++ integer binary search tree program that will insert nodes, delete nodes, search for a node, and print the tree out in order.

Explanation / Answer

#include"stdafx.h" #include #include using namespace std; void insert_tail(); void disp(); struct node { int data; node *ptr; }; node *temp, *temp2; node *st = NULL; void main() { st = new node(); st->data=10; st->ptr=NULL; for(int i=1; idata; temp->ptr =NULL; temp2=st; while(temp2->ptr!=NULL) { temp2=temp2->ptr; } temp2->ptr = temp; } insert_tail(); disp(); getch(); } void insert_tail() { temp = new node; couttemp->data; temp->ptr=NULL; if(st==NULL) { st=temp; } else { while(temp2->ptr!=NULL) { temp2=temp2->ptr; } temp2->ptr = temp; temp=st; } } void disp() { cout

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---