BST implementation - memory allocation in stack and heap

See complete series on data structures here:    • Data structures   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/... Lesson on dynamic memory allocation:    • Pointers and dynamic memory - stack vs heap   For practice problems and more, visit: http://www.mycodeschool.com Like us on Facebook:   / mycodeschool   Follow us on twitter:   / mycodeschool