This project demonstrates: 1. Storing a binary tree in a list. 2. Traversing a binary tree stored in a list (pre-order, in-order, post-order, level-order)
Please see inside for all the algorithms.
