L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation

[@takeUforward]

If you understand, pleaseeeeee like and subscribeeeee :) Do follow me at Insta: striver_79

[@yuvrajchauhan1346]

Bhaiya confidence build horra hai poori series ke baad...pro hojaaunga!....thank you so much !!

[@sagarahir2740]

Is iterative version is cover in series?

[@takeUforward]

@@sagarahir2740 yeah in coming lectures..

[@sarangtamrakar8723]

Bhaiya , space complexity => O(LogN) where N is number of nodes ==> O(Height of Tree) ==> for 16 nodes O(4) space complexity , max 4 function call lies in stack????

[@abhinavgarg0077]

bhai hogaya pro?@@yuvrajchauhan1346

[@theSeniorSDE]

Striver, I watched the complete video and took notes as well. Also will be solving the Leetcode problem.

[@rahulkeshetty6180]

You are the best teacher on KZbin. I have learnt from many youtubers but no one teaches as good as you!!!!!

[@nopecharon]

6:52 for taking notes

[@stepup7052]

thanks mate

[@janhavisoni9147]

You are awesome sir. I was finding it very difficult to understand tree data structures for me. I try hard to learn this but I am unable to understand. My friend suggest your video to me. Now i get it completely thank you so much sir!!💓

[@SayanDas-q7y]

You teach better than the profs of tagged colleges...man🙏🙏🙏

[@pramitsrivastava2579]

thanks sir i had few doubts in recursion but this video cleared it thank you so much

[@-Corvo_Attano]

After watching this video..i implemented the code for postorder and inorder traversal. it's because of Striver Brother👑

[@prasadm3614]

This is awesome ! Thank you ! My special thanks to Kunal Kushwaha for making recursion a piece of cake for me !!!

[@shreyaskulkarni245]

That was most clean explanation about tree traversal I even seen. Thanks for this series btw.

[@PrashantSingh-jy6zp]

for best experience go to 0:43

[@nileshsinha7869]

loving the series so far

[@prabhakaran5542]

Understood ❤

[@lifehustlers164]

Completed 6/54 (9% done)

[@mriduljain1981]

completed 5th lecture of Tree playlist.

[@rakshajaiswal9345]

Thank You so much for the video:)..Simple and well explained in just 7minute.it is very much easy to see video who is just 7min long and to the point.Hard to find such videos on yt

[@snehayadav6715]

really amazing explanation , as much I see your videos , Now I have confidence in dsa

[@hassanshahzad-qp4lq]

what a clear explanation hats off..

[@hareshnayak7302]

Understood,Thanks striver for this amazing video.

[@itzmartin20]

Understood sir! Superb explaination and WONDERFUL recursive diagram :)

[@utsavraj2710]

The Best series available on you Tube....

[@_-6912]

Best Video and looking forward for your DP series for Dussehra!

[@codeby_chance6728]

besttttt mentor!! only good wishes.

[@ABHISHEKKUMAR-ek6dl]

u r awsome sir.. the way u explain it like story..... plzzzz sir make complete dsa course it will help for non cs branch student

[@aanshuaggrawal394]

Binge watching tree series😂😂

[@UttamKumarSinha1234]

Ultimate learning style.

[@anshulbhardwaj2666]

that was the best explanation of pre order traversal thank you very much striver bhaiya.

[@nawabkhan4916]

great work, and have lots of sponsor ad so that you can provide great videos.

[@DhruvSharma-mh5vf]

Fabulously explained sir

[@dipeshjadhav1546]

Loved it man! Thanks for all the hardwork you put in.

[@bhavkushwaha]

Thankyou Striver, Understood!

[@nomadic_kishan]

bhai isne to halwa bana diya :) ( very simple explanation )🥳🥳

[@jayadubey_22]

On board explanation for recursion 🙌🙌thank you so much

[@cinime]

Understood! Super wonderful explanation as always, thank you very much!!

[@samuelfrank1369]

UNDERSTOOD. THANKS A LOT

[@supriyakeshri78]

please add string series also

[@aryatsrivastava692]

UNDERSTOOD !

[@RiskyRoshan23]

Abhi mja ayega na bidu 😝😝😍😍

[@adityakotwal35]

tum kyu padh rahe ho??

[@JohnWick-kh7ow]

@@adityakotwal35 spammer hoga

[@sarangkumarsingh7901]

Awesome 👌 ❤

[@apmotivationakashparmar722]

Thank you So much

[@atharvakulkarni2024]

Excellent Content...Dp Series Please Bhaiyya!!

[@mohit7717]

Short and crisp code ... before watching your series I think its tough to understand its code.

[@TON-108]

Understood 🙌🏼

[@sonalisingh7932]

understood 👍👍

[@prachipatil6110]

Understood..easy explanation!!

[@baladevtanmayatilakmohapat7877]

Beautiful Explanation ❤❤

[@sonakshibajpai6445]

Thank you striver

[@lourduradjou182]

wonderful

[@ananyamohanty414]

you are a gem

[@Ergoswami]

Completed!

[@Lakshya-f4l]

Understood!

[@StudyYuv]

ty striver🤩🤩

[@vakhariyajay315]

Thank you very much. You are a genius.

[@ganeshvhatkar9253]

Understood

[@Manoj_Reddy22]

Amazing explanation

[@saurabhnishad9631]

understood!

[@pritishpattnaik4674]

Bahut mast Striver bhaiya

[@atulk9122]

saalo ka doubt clear ho gaya, dry run se

[@KoushikDas2005]

Thanks 20 May 2024❤

[@hakunamatata-nl4js]

Thank you

[@mokshmehan7695]

Thanks sir

[@tamilbharathi563]

wow thanks for showing him in my feed

[@KartikeyTT]

tysm sir

[@rudranshvyas7539]

Bhaiya inka ek baar c++ me implementation dikhana nextt videos me

[@takeUforward]

Link in description

[@manasjena5124]

​@@takeUforwardsir main odisha se ho balasore district se .sir main implementation link nehi dikhe parah hu.please help me

[@prateekverma9166]

thanks striver

[@sejalrai30]

striver is the best

[@jyoti78895d]

u r best

[@Girish415]

Understood

[@tps8470]

yes

[@ayusmanarya3796]

Thanks A lot Striver bhaiya

[@pavipavithra8299]

Bro ur explanation is great but white board is not clear

[@zafareqbal2893]

big fan, spiderman

[@akshatchaube1213]

L 5 done

[@mahaksharma7827]

👏👏👏

[@lavanyaprakashjampana933]

we love your content and we love you....🖤

[@avdeshsingh001]

understood

[@abhinavvgoyall]

Superb Content!

[@mayanksaurabhmayanksaurabh9271]

great explanation man thanks

[@shivamtiwari3672]

understood

[@KrishnaKumar-b4m9p]

in the function we are first passing the address of the root node. so the argument should be a pointer right??

[@rajbhushan3541]

yes, think of it as a pseudocode

[@psibarpsi]

Time complexity: O (n) Time complexity: O (h) n = number of nodes in the tree, h = height of the tree. Isn't this correct? Somebody!

[@SJ_46]

Yes, but also in a problem h can be at max n, so we can say that the space complexity is O(n) as well.

[@amanverma9829]

correction at 6:30 time complexity is Big O of N i.e. O(N).

[@ab.dariefkhan1737]

Splendid man ❤️😍👍

[@saurabhtiwari287]

Legend sir ur legend

[@satyabratamanna4430]

You are amazing..

[@harshitjaiswal9439]

Understooddddd!

[@helloworldkhalid]

thanku bhai

[@gauravraj5313]

good series

[@as_a_tester]

tysm striver bhai

[@gaganadev2468]

Thank you.

[@_hulk748]

understood sir🙏🙏❤❤

[@shubamgoswami]

COMPLETED

[@krishnavamsichinnapareddy]

Understood 👍

[@nagavedareddy5891]

Huge respect..❤👏

[@nerf2op]

Bhaiyya best🥺🥺

[@aasthajha1051]

mazedaar!!

[@sujithsaikalakonda4863]

well said

[@singhs_aniket]

Understood 👌👌

[@md.imrankhan6912]

Magician

[@rahulhembram4519]

UnderStood

[@anuraggulati2167]

maza aagya bhai thq