Tree Traversal in Data Structure | Infix to Postfix | inorder and preorder is given find postorder
Вставка
- Опубліковано 19 вер 2024
- Solution of Most Difficult MCQs on Tree Traversal in Data Structure
inorder and preorder is given find postorder
infix to postfix conversion
1.The reverse Polish notation of the following infix expression [A*{B+C*(D+E)}] / {F*(G+H)} is
2.Consider the traversal of a tree
Preorder → ABCEIFJDGHKL
Inorder → EICFJBGDKHLA
Which of the following is correct Post order traversal?
3.The pre-order traversal of a binary search tree is given by 12,8,6,2,7,9,10,16,15,19,17,20. Then the post-order traversal of this tree is
4.A binary search tree is constructed by inserting the following numbers in order :60,25,72,15,30,68,101,13,18,47,70,34
The number of nodes in the left subtree is
Finely cleared mam. Thank you so much
Mam your teaching is Excellent and Marvelous keep rocking Mam Thank you for your efforts
I salute you madam for your teaching
Fascinating Teaching madam
Thank mam, atlast many doubts clear because of you mam
Nice presentation!!
Very nice explanation mam
It's very helpful.. thank you..
Thank You Mam
Very nice mam
Very clear explanation
Very clear explanation mam.thank you
Super explanation mam 👍
Concept cleared....Thank you mam
Vèry çleàr màm,thànkß
thank you mam ...wonderful explaination
super explanation mam.thank you mam
Master theorem ad recurrence relations short video mam
Mam sach me mera doubt clear hogaya...mam but if it is postfix to prefix. How can I do mam
Hamming code with one session mam
Hi mam
Upload it again..as vedio is not clear ..
Video quality is clear. Check your internet connection