Part 3 of 15 in Binary Search Trees  

BST Implementation - Memory allocation in stack and heap

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.