C++ implementation. ZERO memory leak. Efficient code for binary tree along with resource allocation
Creating a singly linked list to store user inputs corresponing to each node. Creating binary tree from this linked list. Implementing Iterator class for both linked list and tree. Tree creating uses the Iterator class of singly linked list for traversing.