pre-order
: parent->left-child->right-childin-order
: left-child->parent->right-childpost-order
: left-child->right-child->parent
height
of a tree: the number of edges from the root to the farthest leafdepth
of a tree: the distance from any node to the root node. That means height = max(list of depths)size
of a tree: the total number of nodes of the treeleaves
: nodes with no childrenbalance factor
: height of left subtree - height of right subtreefull
binary tree: if all nodes have two children, except the leaf nodes