Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
BinTree
//g++ 7.4.0 //Binary Tree // code is created by Rezaul Hoque on March 2 ,2021 //please contact at jewelmrh@yahoo.com #include <iostream> using namespace std; class node{ public: int data; node*left; node*right; node(int d){ data=d; left=NULL; right=NULL; } node* create(int d); node*& pRight(){ return right;} node*& pLeft(){ return left;} }; node* node::create(int d){ if(d<data) { left = new node(d); return left; } else { right = new node(d); return right; } } void traversePre( node *p) { if (p != NULL) { cout << " " << p->data; traversePre(p->pLeft()); traversePre(p->pRight()); } } // Traverse Inorder void traverseIn( node *q) { if (q != NULL) { traverseIn(q->pLeft()); cout << " " << q->data; traverseIn(q->pRight()); } } // Traverse Postorder void traversePost( node *r) { if (r != NULL) { traversePost(r->pLeft()); traversePost(r->pRight()); cout << " " << r->data; } } int main() { node* root = new node(8); root->create(7); root->create(2); root->create(9); root->create(10); root->create(1); cout<<"Pre order:\n"; traversePre(root); cout<<endl; cout<<"In order:\n"; traverseIn(root); cout<<endl; cout<<"Post order:\n"; traversePost(root); return 0; }
run
|
edit
|
history
|
help
0
Radix
GCC compiler bug (should output 0 1)
Wipro Problem 1: generate roll number
MemCpyClass
NWD
char strcpy
1
vertical sum
find parent count of node in graph
OOP