Construct Binary Tree From PreOrder And Inorder (Code) - C++

[@CodingNinjasIndia]

Join our Coding Ninjas official telegram community here: t.me/codingninjas_official

[@ankitbanerjee4868]

I was searching for the explanation for this problem on youtube. Believe me, when I say this, this explanation is the best explanation I got.

[@durjaarai7737]

100%

[@sankalparora9374]

Some people have a knack at explaning stuff, and Ankush Singla is one of them. Thanks for the explanation!

[@CodingNinjasIndia]

Hi @sankalparora9374, Thank you for the kind words! We hope that this video has helped you! Stay tuned to Coding Ninjas KZbin channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home? If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library? If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?

[@ankitsharma8221]

Awesome explanation. Just a suggestion: We can store all the values of the inorder in a lookup table and pass it as an argument Won't have to calculate the rootIndex each time :)

[@ryan-bo2xi]

Excellent explanation ! It deserves more likes .. hats off

[@renudixit3087]

Awesome explanation , you make it so easy to implement, thanku

[@SR-we1vl]

I've worked out the math for PostOrder Traversal. Is it good to go!? int lInS = inS; int lInE = rootIndex - 1; int rInS = rootIndex + 1; int rInE = inE; int lPoS = poS; int lPoE = lInE - lInS + lPoS; int rPoS = lPoE + 1; int rPoE = poE - 1;

[@user-mi8ew2to8e]

Ab ja ke mere ko ye samajh me aaya hai...subscribed.

[@unmeshguleri5306]

That was an awesome explanation, it was simple maths as told by you. Thank you for it.

[@CodingNinjasIndia]

Thank you for the kind words! We hope that this video has helped you! Stay tuned to Coding Ninjas KZbin channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home? If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library? If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?

[@kuldeepnarayanminj]

best explaination on youtube

[@AbhishekJha-wm5oq]

VERY GOOOD EXPLANATION!

[@Deepak-jk1eh]

very big thank you for this explaining generally i don't like to write comment on video but for this explanation i did this .

[@anubhavnema613]

Awesome Explanation

[@chandrahassoman6648]

What a nice explanation! Maza aa gaya.

[@ankithans5916]

you made it easy..

[@NadinMagdy]

Indians if you're gonna talk hindi in the video, just WRITE IT IN THE TITLE

[@gamingparlour1732]

ek number sir

[@MrPranavsss]

Great Explanation. Followed every bit of it. Thank you so much for this :)

[@prakashshukla3558]

Super cool awesome video , i will try to make video as good as this one.

[@Sushil2874]

Awesome explanation ...!!

[@shubhiaggarwal7873]

The following list of letters are inserted into an empty bst:J,R,D,GT,E,M,H,P,A,F,QFIND final tree.....sir please tell me answer with explaination

[@TW-uk1xi]

It can be done in more easy way. You are using so many variable unnecessarily which makes code messed up. And this will be slow since you are searching root index every single time.

[@sankalparora9374]

Root to dhoondna hi padega...

[@sankalparora9374]

Zyada variables make code look way easier than the other implementations jisme only the seasoned tree developers can understand things.

[@awaisakhtar1139]

We are finding the root using a loop so maybe in case of duplicate values, it might not give us the desired output. Any solution to this?

[@abilashg3862]

Sir , this is which kind of recursion?? top to bottom (or) bottom to top

[@sahazeerks2363]

top down recursion

[@rethink20s]

This code is working fine in eclipse ide..but I tried this code in compititive programming console is showing stack overflow

[@soham2732]

Really cool explanation 🤟🏻 .. Thanks :)

[@CodingNinjasIndia]

Thank you for the kind words! We hope that this video has helped you! Stay tuned to Coding Ninjas KZbin channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home? If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library? If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?

[@shivammaheshwari8465]

Great Explanation, best on youtube

[@devendrameena2540]

awesome explanation dude.. you've got a new subscriber!!

[@questtech2979]

sorry to say that but your solution doesn't work on leetcode. but however explanation is great

[@drishtipoddar9065]

Sir has mentioned that he is assuming the length to be the same. Maybe the program in leetcode has different lengths of arrays of inorder and preorder. Or maybe leetcode has repetitive inputs.

[@diveshrajput572]

@@drishtipoddar9065 or may be he don't know how to type on keyboard.

[@drishtipoddar9065]

Divesh rajput or maybe u don’t know the English language to frame a correct sentence

[@aneesaziz3611]

left preorder end computation not clear to me. can anybody plz explain? Thanks

[@shethnisarg3049]

just one word WOW!

[@karthikk5895]

What's the running time complexity of this algorithm?

[@ankitsharma8221]

O(n * n)

[@Sauravgpt34]

Thank you so much sir. How can get your complete course?

[@ajaytyagi3018]

nice

[@ritikgupta5240]

print tree function kaise banaya ?

[@alphabeta6272]

satisfaction

[@4Dgenius]

What language is it? Half english half Hindi?

[@kunalkumarshrivastava]

yes

[@tanmayjain5821]

Noice

[@yayyy5866]

not a good solution ....not sagtisf time complexity

[@MustafaKHAN-sw1xb]

Sir mujhai competitive programming ka course karna hai

[@Sanjeev.Network]

Yes, Coding Ninjas Do have competitive programming Online Classes. Taught by STANFORD and FACEBOOK, AMAZON, MICROSOFT EMPLOYEE. You can go to the below link and have discount of Rupees 1200/- codingninjas.in/app/invite/ZVUAQ

[@Sanjeev.Network]

Yes, Coding Ninjas Do have competitive programming Online Classes. Taught by STANFORD and FACEBOOK, AMAZON, MICROSOFT EMPLOYEE. You can go to the below link and have discount of Rupees 1200/- codingninjas.in/app/invite/ZVUAQ

[@aryanpathak9232]

Awesome Explanation