BST implementation - memory allocation in stack and heap

By mycodeschool

Community Score: 50% | 316.1K views | 12y

0 community ratings: null thumbs up, null thumbs down

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described how things will move in stack and heap sections of application's memory when binary search tree program discussed in previous lesson will execute. See source code here: https://gist.github.com/mycodeschool/44e1a9183ab0e931f729 Lesson on dynamic memory allocation: http://www.youtube.com/watch?v=_8-ht2AKyH4&list=PL2_aWCzGMAwLZp6LMUKI3cc7pgGsasm2_&index=12 For practice problems and more, visit: http://www.mycodeschool.com Like us on Facebook: https://www.facebook.com/MyCodeSchool Follow us on twitter: https://twitter.com/mycodeschool

Tags: Binary Search Tree, Memory Management, course, memory, hire, job, school, software, programming, interview, coding, program, code, C++, Computer Memory, Stack-based Memory Allocation, C (Programming Language), yt:cc=on