Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #107.41K
|
#include <iostream> using namespace std; struct node { node * right, *left; int info; bool lthread,rthread; }; class tree { private: node *temp,*current; public: node *root,*Dummy; void insert(node*,int); void inorder(node*) ; node* next_node(node* ); tree() { temp=root=current=NULL; Dummy=new node; Dummy->left=root; Dummy->right=Dummy; Dummy->rthread= Dummy->lthread=false; } } ; void tree::insert (node *temp,int … |