Binary Tree

🔥 Balanced Tree → Used By → Binary Tree Provides the core node/child model and traversal framework that balanced variants build upon.

🔥 Binary Search Tree → Extends → Binary Tree The general binary tree structure provides the foundational node/child layout and traversal framework from which BSTs are defined by adding an order constraint.

🔥 Complete Binary Tree → Extends → Binary Tree Provides the foundational node/child structure and properties from which the complete variant is defined by adding level-filling constraints.

🌟 Priority Queue Adt →

⚡️ Heap →

⚡️ Breadth First Search →

⚡️ Depth First Search →

⚡️ Avl Tree →

Red Black Tree →

Expression Trees →

Huffman Coding →

Segment Trees →

Fenwick Trees →

Abstract Syntax Trees →

Parsers →