Understand tree terminology: root, parent, child, leaf, height, depth. You should be comfortable with recursive tree traversals: preorder (root first), inorder (left-root-right), and postorder (children first).
Binary Search Trees (BSTs) are a special case where left children are smaller than the parent and right children are larger. Many tree problems exploit this ordering property for efficient search operations.