🔥 balanced tree → Balanced trees (e.g., AVL, Red-Black) specialize binary trees by enforcing balance criteria and using rotations to maintain near-logarithmic height.

🔥 binary search tree → A BST specializes a binary tree by enforcing an ordering invariant on keys (left < node < right), enabling efficient ordered search, insertion, deletion, and in-order traversal.

🔥 complete binary tree → A complete binary tree is a specialization of a binary tree that extends the base structure by imposing completeness: all levels are full except possibly the last, which is left-aligned.

🌟 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 →