Study
Focus:
⚡ Flashcards 🏆 Quiz (8) 🌁 Slideshow

Binary Tree

Flashcards
1 / 5
data_structure abstract_data_type tree rooted_tree ordered_tree k-ary_tree graph acyclic_graph
💬 Click on the content to Ask AI
Explore More
🔥 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 →