Trees and Binary Trees
A tree is a hierarchical structure made of nodes joined by parent-child links, with one special node, the root, and no cycles.
Data Structures · topic
Trees and binary trees
Binary tree terminology and the node, leaf and height relations, full, complete and perfect trees, k-ary trees, array representation, traversals and reconstruction from two traversals, expression trees, Catalan counts of shapes and labelled trees, and threaded trees.
Study this topic
Binary Tree Traversals
A traversal visits every node of a tree exactly once, in some systematic order. For a binary tree there are three natural depth-first orders, distinguished only by when the root is visited relative to its two subtrees, plus the breadth-first level order.
Trees and binary trees cheat sheets
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.