BST implementation - memory allocation in stack and heap

[@apl1mhd]

No one knows mycodescholl funder dead :( Harsha S, co-founder of MyCodeSchool has passed away in a hit and run accident case. Harsha was our guiding force, a gem of a person, and the best rated coder from India in programming contests. This is a big loss for us and we may never be able to recover. You were a great teacher Harsha. You were a candle who has lightened many other candles and you will live in the light of others. May your soul rest in peace!

[@pacchutubu]

oh really sad to hear this :(

[@jameshong7706]

Really sad to hear this. RIP.

[@wilacademy8916]

RIP

[@pulak727]

Really appreciate the hard work that you have undertaken to create a video series like this. This video is perhaps the best example of your dedication. Never have I seen/heard some one explain heap, stack states and program execution in such an elaborate methodology the way you have explained. It's beautiful. Hats off!!!

[@sarthakbatham1839]

trying for a week to understand BST just now took 15 mins to understand it this guy is an alien.

[@yashvardhancn44]

whoever is teaching in this video...just know that, you guys are the best..keep making more videos..

[@ChetanRawattunein]

I wish I had seen your video lectures in my first 3 yrs of college. coding would have been so fun u took 13 mins to make me understand something that my clg professors could not do in 3 yrs

[@amanmishra-vt8hk]

I don't even think that my dictionary have that precious word to describe your teaching.

[@amanchaudhary1616]

Sir You Are the Best CPP/C teacher as far as I know. PLEASE make more VIDEOS. I love the way you teach.

[@shivabansfore7510]

finally i got the best lecture on data structure in youtube..thank you so much the way you explain is of next level...i hope that i will get more of videos from you...

[@mihirtrivedi2429]

Wow. Just wow. So clearly explained. I am a Masters' student in California who has never studied data structures and this is very helpful. Thanks.

[@theboringdev]

Hey man!!! My lecturer spent almost a week on this lesson but it take me just a few of your video!!!! Thank man!!! Keep up good work!!! :)

[@ankitsingh8087]

the way you are teaching is really awesome....learning concepts with coding makes me easy to understand data structure. Thank you

[@josefugaming3482]

THANK YOU for these videos. Your description of the philosophy and the code are very informative. It has helped me dozens of times to realize and understand more deeply about what is going on in a program.

[@vulligadlarohith4]

One stop solution for all the learners out there!! 👏Very crisp and Clear. Kudos for your efforts 🙏

[@danilo2735]

man, just know you helped so many people

[@seanodonnell6119]

why am I even in college, I should just be following you around

[@nguaial8490]

u have a point. we are stuck with the society that values BS degree rather than knowledge. this society is trying to squeeze out every dollar to colleges.

[@pdcx]

so true

[@abhijeetagnihotri655]

I feel the same

[@SidathGajanayaka]

Superb lectures! Simply amazing! Keep it going... Without wasting hours (like in most other KZbin videos), you explain everything in a few minutes. Well done indeed... :)

[@RealMcDudu]

You need a lot of patience to explain this - well done! :-)

[@kafychannel]

it is really important to understand this thing, thanks

[@boshiij3449]

This is the most important video I watched to help me understand Trees. Thank you so much!

[@tusharikas5447]

If someone has to hire a lecturer , they must be asked to explain this implementation and then hire!

[@Explore_with_anish]

I think stack is the uppermost section and heap section is below the stack. heap grows upwards and stack grows in downward direction.

[@beanhahaha]

This video is great! It helped me realized the bug I was trying to find about dangling pointer you mentioned and improved my understanding of binary search tree! Thank you so much!

[@manojpandey7517]

I don't like commenting on KZbin videos but boy! there were quite a few moments of realization as I went through this video.

[@devaljain1998]

Thanks a lot, sir. Really nice and best explanation one could find online. I was frustrated about learning trees for a very long time, but this cleared all my doubts and I think I have understood and grasped everything you taught. You are doing really nice work, sir. Thanks Again!

[@vivekgr3001]

really appreciate the effort in explaining in so detail. Good Job

[@csudharsan]

Very nice explanation on Binary Tree . I liked all your videos on data structures. You made my learning very easy. It moved my understanding to the next level. Thank You very much.

[@mycodeschool]

sudharsan chakravarthy You are most welcome :)

[@nvijain]

thanks a lot man for making awsome videos and giving superb explanation...But it's sad that you are not making new videos. We would love to watch them

[@amateurbeginner7538]

this man is a genius in explanation!!! do you know any other channels like this level??

[@kuldeepkumarpandey3881]

Yeah there r many. Check CS dojo, cs50

[@gauravgarg8465]

@@kuldeepkumarpandey3881 cs dojo also follows the same channel.. Hats offf to this guy.

[@VarunVishwakarma1]

I feel like touching your feet. I was scared of Data Structure. You made it super easy. Please make videos on maths(For computer science) if you could

[@iamarmishra]

I want to see the faces of those 10 people who disliked the video. I mean what more do you need?

[@lampham7874]

They think that that is the download button.

[@Bhatonia_Jaat]

now 27

[@ayush4565]

now 27

[@abhishekbhardwaj5087]

Now 30

[@anmolbaunthiyal2827]

Those are the teachers from my college they are jealous

[@biswarupchatterjee9692]

Hey King! You dropped this 👑

[@unperrier5998]

FYI the stack is not fixed in size at compile time but at runtime. See "ulimit -s" to view and change the stack size (superuser privileges are required to change it)

[@JZX619]

Love this explanation. Architecture of programming is fascinating.

[@SandeepKumar-kv7mm]

thanks... to show bst implementation with the help of stack and heap.really it is easy to understand .thanks once again..

[@aadypillai5808]

im crying its so beautiful

[@spicytuna08]

great video. the understanding of the persistence of the memory in stack and heap is so important. even with this understanding, it gets very messy with code. e.g. function creates stack but within the function heap memory was allocated. so after the function terminates the heap memory is still persistence. it is kind of confusing. so when heap memory is created, i don't see the usage of declaring local variables. it is global since the the variable lives on after the function terminates.

[@sanketpawar3429]

Your efforts are priceless ❤️

[@nishant_soni97]

thank you mycodeschool...you are hero!!!

[@sanjeevashoka7948]

Thank you so much, the way you deal with the concept is really awesome ..........

[@黎銘-s9n]

Once more I see beauty in C++.

[@shivasaireddy7372]

Genius explanation!!! simple yet very effective!!!

[@Mandeepsingh-jo5cf]

u have great understanding of algorithms

[@patrickren7395]

I found that in the case of Binary Search Tree, insertion will always generate a leaf, since at the end of the recursion, a node without left and right pointers will be generated.

[@nguaial8490]

wow. this clarified my understanding how recursive works. thank you ... there must be better way to avoid this same pattern: root = Insert(root, number); i suppose if root is a global, there is no need for this repetitive pattern.

[@nikhilbadyal]

The global declaration is not good one should avoid it as much as possible. Try to pass it by address.

[@thinkingmad1685]

@@nikhilbadyal can you pls say y it is so. Just asking to know?

[@Bakasta170]

@@thinkingmad1685 it's not usually bad when we are just writing regular programmes, however while in an organization u have to think about abstraction and encapsulation of data. Hence when writing code in projects it's considered bad.

[@yanlingyang256]

thanks a lot!!!!very clear!!!! i am going through all the videos, cannot express how fabulous you are!

[@harishpanwar9021]

very good explanation talented guy.

[@DHIRENX]

Superb explaination

[@amitavaroy5723]

Outstanding work! I am so glad to have found this channel. Thank you!

[@ajayarora2376]

Brilliant.Couldn't have explained better. Thanks.

[@smailkoubi6547]

Now that was an explanation ! Thanks Man !

[@VirajChokhany]

Thank You Sir Everything was amazingly explained. I would request you to upload videos on other data structures topic.

[@CODINC]

Perfect video. Ur the best teacher

[@arpitmaheshwari3960]

Thank you mycodeschool for these great videos.! Complete description to Data Structures with such good explanation is what one needs. Sir may i know if i can download all these videos from a single link or a drive location. I very much need them.

[@jagadishgnaik3302]

Awesome Sir, you made it crystal clear. Thank you🙏

[@divyanshpandit6509]

explanation is absolutely beautiful!

[@antaratewary9645]

why have you stopped uploading videos?? Please, we need atleast one teacher that we can rely on.

[@thiernodicko7070]

Thanks for this amazing explanation....

[@ayushisharma1381]

Thank u so much sir for such good explanations 🤟

[@mitultyagi3357]

One of the best thing I learned...thanks man...

[@ankurgupta4696]

awsm bro really i havent seen the explanation made so easy before :)

[@usama57926]

thank u bro your explanation is amazing. Are u a teacher?

[@095_shaniabalkhi9]

Great tutorial. Thank you sir!

[@mohammedhashimk4153]

you are great!! I enjoyed every word of it.

[@girirajalone7825]

Thank you so much for making such a good content/info video ☺

[@yashaswiification]

i am thanking u making data structure easy...

[@AayushSharma-io7qu]

great explanation

[@praslisa]

the best recursion and tree explanation !!! thank you :)

[@aswin2pranav]

This is a great service. I salute you!

[@mohammedrafeeq4902]

thank you very much!! i like your videos very much as you explain in terms of application memory

[@prakalpshakya1466]

Respect for you Sir !!

[@aliasgar1648]

Excellent explanation !!

[@vasiletonofa6262]

Thank you Sir, you make our life easier and better ! very good explanations .

[@মহাজাগতিকআলো]

Ur lecture just awesome.......

[@RomyIlano]

Thanks your series is so good!!!

[@vandana944]

great videos..thanx a lot :)

[@ssonline6610]

commendable efforts...great

[@rd-tk6js]

Succinctly explained. Thanks !

[@markpascual100]

you are missed sir rest in peace '

[@paula19335]

He is not dead.. the other co-founder named Harsha died. The guy from the video works for google today

[@unknown-bc3uh]

Thanks

[@ManishThakur-jp7zm]

Bhai upar itna accha padha rahein hai aur tumhe comments padhni hai?

[@abdullahbabor4876]

Thank You!

[@ripalthakkar1902]

Thanks for teaching !

[@yunustaliperol6912]

Excellent...

[@zillboy]

Wow! I need to watch this video again! Thanks though!👍

[@alisayed_95]

Really Great and helpful!! Love you sooo much brother

[@yashshrivastava1648]

please turn off your adblocker while watching these videos

[@johnnywu9]

Very nice tutorial. one question, What do actually the 200, 250,300 mean?

[@abhijeetagnihotri655]

Those are memory addresses which in actual case what we deal with are in hexadecimal form but it has been simplified in this case

[@agarwalminal]

Can you provide the iterative implementation of this insert function?

[@animeshnayan1]

minal agarwal I would recommend that you try to write the code yourself and send it to us if you are stuck. You can write to [e-mail]

[@amrutajoshi3087]

animesh nayan

[@amrutajoshi3087]

animesh nayan

[@chodisettylakshmi2320]

thanks a lot ! great explanation

[@AlMarufSharif]

Awesome!! Very nice video. Thanks :)

[@shubhanganitayal8185]

how to search for description link or how to access source code?

[@AnirudhDua]

awsome

[@aakarshikasingh4715]

Hi! Could you share the iterative solution for the creation of a binary tree.Just a bit confused!

[@RohitSingh-qy7dh]

nice explanation .......

[@kevinmackey3166]

I'm a little bit confused. From the practices described in previous lessons, I would expect that the dynamically allocated memory in heap should be freed after each iteration. But here it looks like you are just leaving them there until the program finishes running. Under what conditions should the variables in allocated memory be cleared?

[@25knightcrawler]

+Kevin Mackey You are supposed to free memory when you are deleting some data not when you're inserting some data..In the video at 6:35 '15' is inserted first and memory is allocated on the heap to store the value '15' and the location of that memory '200' is stored in the root variable..Now if you free up memory location 200 in the heap you'll be left with a root pointer pointing to the location 200 which wouldn't have valid data (Since that location was freed). All the data is stored on the heap that is why you don't free up those memory locations.

[@kevinmackey3166]

25knightcrawler Ahhh okay, that makes sense now.

[@Bakasta170]

Thanks man 🥳🥳🤩👌

[@TheGrimReaper0101]

thanks mycodeschool

[@wangchi562]

Thank you so much sir!!!

[@johnnybatafljeska6368]

10:08 where can we see in code that we are passing 300 as root? How does the root change from 200 to 150 or 300 (I know those are subrees, but I cant understand that in code)

[@sourav7094]

Why are we taking two arguments in 'Insert' when we could have declared the root pointer as global? It would have been much simpler, won't it?

[@ezetreezy]

root pointer should be hidden IMO within the class bst. have an insert(int data) as public, which calls a private function insertPrivate(int data, node * root).

[@rahuls331]

You can but insert always requires a node pointer for insertion recursively in the tree.

[@Manibabu60]

simply #grt...

[@Mandeepsingh-jo5cf]

thanx for sharing