At most 2 children per node Children called left and right A kind of Tree It defines Binary Heap, Binary Search Tree Properties Full Complete Balanced Traversal Recursive Preorder Traversal, CLR Inorder Traversal, LCR Postorder Traversal, LRC Iterative Levelorder Traversal