construct binary tree from inorder and postorder traversal | HINDI | Niharika Panda

preview_player
Показать описание
binary tree from postorder and inorder
Рекомендации по теме
Комментарии
Автор

thank you so much mam👌😊😊😊😊👍👍 i have cleared all the doubts regarding traversal of tree from in-order and post-order. thank you so much/

adityakumarsahni
Автор

Wonderful explanation in a short time
Thanks mam 🙏

Srinjoy
Автор

amazing
explanation in a short time maam

sthitipragyanjenna
Автор

Exam at 9pm and me preparing for exam in bus 😂
Thank you mam ❤

srinud
Автор

Mam agr iska preorder nikalnge to kya ho ga

Aldol-nsjk
Автор

When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
a) FAEKCDBHG b) FAEKCDHGB c) EAFKHDCBG d) FEAKDCHBG


. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
a) ABFCDE b) ADBFEC c) ABDECF d) ABDCEF

di ye wale do questions ke sol pe video banao na first ka ans hai b and 2nd ka c

vishaljaiswar
Автор

Madam pls make the video on when only one traversal is given??

-neerajajadhav
Автор

Ma'am please Threaded binary tree & Huffman tree ko samjha dijiye by vedios 🙏🙏🙏🙏

AmanYadav-rrfi
Автор

Hey ... Your explanation is awesome But as a beginner If a person doesn't know any of the terms like
post order, inorder and preorder....you should deliever your content with little bit detailed

dipeshchoudhary
Автор

The In-order and Post-order
traversal of a binary tree are
given as below. Draw the tree.
(i) In-order : BEDFCAGHJIK
(ii) Post-order : EFDCBJKIHGA


Pls iska answer bta do 🙏🙏🙏🙏🙏

vishalmishrausername
Автор

2 sathme smjanese conference hota he....

hardiktailor