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:
gist.github.com/mycodeschool/44e1a9183ab0e931f729

Lesson on dynamic memory allocation:
   • Pointers and dynamic memory - stack v...  

For practice problems and more, visit: www.mycodeschool.com/

Like us on Facebook: www.facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool