Stacks are last-in-first-out, queues are first-in-first-out, and a binary search tree keeps values ordered for fast lookup.