Coding Basics

---

Data structures are organized ways of storing and managing data so programs can access and modify it efficiently. They provide the underlying containers—like arrays, lists, stacks, queues, trees, and hash maps—that OOP classes often use to hold and structure information.

 Tree structures — like binary trees or search trees — become far more intuitive when modeled as objects. Each node can be an object containing its value and references to child nodes. Methods like insert(), traverse(), or find() belong to the tree or node class, making the structure modular and easy to visualize. 

 A queue object represents a real‑world waiting line. It stores elements internally and exposes behaviors such as enqueue() and dequeue(). Encapsulation ensures the internal list or pointer logic stays hidden, while the queue behaves predictably no matter how it’s implemented. 

 Arrays can be represented as objects that store values and provide behaviors like inserting, removing, or searching. Instead of manually managing indexes, an array object exposes clear methods (append(), pop(), sort()), encapsulating the internal details while giving developers a clean interface. 

  Object‑oriented programming (OOP) is a way of organizing software around objects — self‑contained units that combine data and behavior. Instead of writing long, linear code, OOP models programs after real‑world concepts, making systems easier to understand, maintain, and extend. 

This project demonstrates how array-based binary trees can be visualized and interacted with using Python. It includes features like node insertion, parent-child highlighting, and animated tree building — all designed to make abstract data structures more intuitive.