Binary trees
↑Binary trees reserve a left and right position per node. Compare linked-node and array layouts; distinguish complete, perfect, full and balanced instead of treating those labels as synonyms.
How to study this section
Section titled “How to study this section”Start with one concept, work through a small example, and verify your prediction. Follow linked topics when a prerequisite or related idea needs more explanation.
Explore guides and subcategories
Section titled “Explore guides and subcategories”Articles