Iterative Preorder Traversal using Stack

[@melihaslan9509]

I cannot imagine a binary tree can be explained better than this channel!! Thanks a lot for giving us great tutorial on binary tree.. I understand better now..

[@Hrit]

very lucid explanation. Thank you

[@sachin_bhandari8470]

Thank you sir .. please upload more videos on advance data structures

[@amitchoubey7755]

superb

[@sabuein]

Thank you very much, brother.

[@pranavsingh9284]

fantastic sir

[@R4C3h4wk]

Thank you ! easy to understand

[@Useracwqbrazy]

Sir please make videos on heap sort ,along with the code or algorithms of building max and min heap and also heapify

[@abhishekkhandare4872]

I m getting error with this code Onthe line of st.Pop(); Plzhelp me. // binary search tree(BST) //depth first search(DFS) //pre-order traversal //post-order traversalroot> //In-order traveral #include #include using namespace std; class node { public: char data; node* Llink; node* Rlink; node(char x):data(x),Llink(NULL),Rlink(NULL){}; }; node *block(char x) { node *block=new node(x); return block; } node *BST(node *root, char x) { if(!(root))return block(x); else if(xdata)) root->Llink=BST(root->Llink, x); else root->Rlink=BST(root->Rlink, x); return root; } int preOrderTraversal(node* root) { if(!(root)){return 0;} else{ coutLlink); preOrderTraversal(root->Rlink); } } node* preOrderTraversaByIterationl(node* root) { stack st; if(root) st.push(root); while(root) { root=st.top(); st.pop(); if(root->Llink)st.push(root->Rlink); if(root->Rlink)st.push(root->Llink); cout

[@waqaryounis5090]

thank you sir//// please upload priority algorithm in queue

[@Gandhiboy]

Thank you so much

[@45_ritiksharma32]

Upload vidios on time complexity analysis

[@prabhusarathy922]

Great

[@ayushgarg5929]

Complexity ???

[@abhishekkhandare4872]

Sir

[@RohitSingh-ku6nt]

sir how will create a tree

[@RohitSingh-ku6nt]

And sir how will store data in array or dynamic array

[@supamdeepbains5172]

yo yo this guy keep it low low and slow slow oh my god oh

[@azizchafik]

I do this with sample way : I print a root after I push right child and left child until the stack is not empty

[@apurvgolatgaonkar590]

Great