Data Structures

Data Structures is a core topic in the ACSL Junior division (Contest 3). The following subtopics reflect the concepts students are expected to master.

Subtopics

  • Arrays
  • Strings as Arrays
  • Stacks
  • Queues
  • Linked Lists
  • Trees (Root)
  • Trees (Parent & Child)
  • Trees (Leaf)
  • Trees (Depth)
  • Searching (Linear & Binary)
  • Sorting Basics: Selection & Bubble
  • Understanding Memory Layout (Indexing)

Want to practice Data Structures questions?

Sign in to access full ACSL-style problems with instant AI-powered grading and feedback.