Summary

A binary_tree is a structure of node where each node has at most two children: left_child and right_child. The top node is the root; nodes without children are leaves. Each child forms a subtree. Key measures are height and depth. Common shapes include balanced_tree, full_binary_tree, and complete_binary_tree. Basic traversals are preorder, inorder, postorder, and level_order. Typical operations include insert, search, and delete.