First, the kinds of questions
(1) through the tree - the preamble, after the sequence, sequence, breadth-first; Morris traversal;
(2) Determine the height, nodes, path, etc. --- preorder
(3) binary search tree - configuration (dichotomy; type - the movable gauge), verification (inorder traversal to find reverse), repair (reverse find - exchange), using the properties of the n-th node seeking
(4) balanced binary tree - structure (dichotomy, and often with the search tree), verification (required depth variant)
(5) Other: mirror, according to a binary tree traversal configuration
07. Binary face questions reconstruction
. . . Worn out