Trees are hierarchical data structures with a root node and child nodes. Binary Search Trees (BST) keep smaller elements to the left and larger to the right, offering O(log N) for search, insert, and delete on average. Balanced trees like AVL or Red-Black guarantee O(log N).