What math background do I need before starting a data structures course?

If you want a minimal review plan, focus first on log and exponent rules, basic algebra, and the general idea behind Big-O. Then pick up proofs, counting, and probability as they become relevant. Discrete math becomes even more important in later algorithms-focused courses, but you don’t need to master it before beginning data structures.

You can start without taking a full discrete math course first. The most useful preparation is basic algebra, logarithm and exponent rules, summation notation, and an intuitive understanding of Big-O. Those tools cover most of the runtime analysis you’ll encounter. Combinatorics and probability appear less often and are usually fairly light.

Discrete math and proof techniques are definitely helpful, especially for understanding why a runtime claim or data structure property is correct, but they aren’t blockers for getting started. The course is more programming-heavy than math-heavy. Strong Java fundamentals and comfort with recursion are likely to matter more than advanced mathematics, so reviewing those may be a better use of your preparation time.

Don’t feel like you need to front-load a lot of math. Big-O is often more about recognizing growth patterns than doing difficult calculations—for example, understanding why binary search takes logarithmic time. Review logarithms when they first come up and learn the other pieces in context. Basic probability intuition can help with topics like hash collisions, but it isn’t a major prerequisite.