A tree may not be the first topic taught in a data structure 101 class. We may not need to implement a tree data structure for our job, either. However, trees are workhorse data structures and can be used to solve many problems efficiently. Having a solid understanding of tree data structures is very helpful in solving real-world problems.
Besides, building a software project requires broad knowledge. For example, writing code, understanding algorithms, set up environments, test code, and deploy projects. The series aims to provide a simple way to present the concepts of tree data structures, the philosophy of object-oriented programming, and the software development cycle method altogether. Hopefully, this can be a different way to help people understand tree data structures and software development.
The plan is to build many tree data structures, i.e., a Forest, in multiple languages.
Build the Forest in Python Series
- Binary Search Tree (Last Updated at 03-13-2021)
- Binary Tree Traversal (Last Updated at 07-03-2021)
- Single-Threaded Binary Search Trees (Last Updated at 07-10-2021)
- Double-Threaded Binary Search Tree (Last Updated at 07-03-2021)
- Red-Black Tree (Last Updated at 04-30-2021)
- AVL Tree (Last Updated at 06-06-2021)
- AVL Tree vs Red-Black Tree (Last Updated at 07-02-2021)
- Make the Forest Thread-Safe (Last Updated at 01-27-2022)