Trees are hierarchical structures with a root node and child nodes. Binary Search Trees (BST) maintain order: left children are smaller, right children are larger. This enables O(log n) search, insert, and delete. Balanced Trees AVL trees and Red-Black trees are self-balancing BSTs that guarantee O(log n) operations by automatically restructuring after insertions and deletions. Heaps are complete binary trees used for priority queues — a min-heap always gives the smallest element in O(1). Big-O Notation Big-O Notation measures how performance scales with input size: O(1) constant, O(log n) logarithmic, O(n) linear, O(n log n) linearithmic, O(n²) quadratic. Always aim for the lowest complexity. Understanding Big-O is essential for technical interviews and writing performant code.