A-Level Computer Science — Data Structures — Trees, Graphs and Hash Tables

15 flashcards covering Data Structures — Trees, Graphs and Hash Tables. Designed for A-Level Computer Science revision using spaced repetition.

Computer ScienceA-LevelAI curated

15 cards in this deck

This free A-Level Computer Science deck covers A-Level Computer Science — Data Structures — Trees, Graphs and Hash Tables. Every question in the deck is listed below — sign in free to flip each card, reveal the answer, and rate your confidence so spaced repetition can schedule your reviews for you.

All 15 questions in this deck

  • Tree data structure
  • Graph types
  • Hash table
  • Tree traversal
  • Graph traversal
  • Binary tree
  • Hash collision
  • Graph edge
  • Tree node
  • Hash function
  • B-tree
  • Graph adjacency
  • Tree height
  • Hash table resizing
  • Graph adjacency list

Sign in free to see the answers and study this deck with spaced repetition.

See all 15 cards and track your progress — free

Frequently asked questions

How many flashcards are in A-Level Computer Science — Data Structures — Trees, Graphs and Hash Tables?

This deck contains 15 flashcards, each with a question on the front and the answer on the back. All the questions are listed on this page — create a free account to flip the cards and see the answers.

Is this A-Level Computer Science deck free to study?

Yes — every deck in the Nextutor library is free. Sign in with a free account to study the full deck, rate your confidence on each card, and track your progress over time.

How does spaced repetition work on Nextutor?

After you flip each card you rate it Hard, OK or Easy. Cards you find hard come back the next day, OK cards in about three days, and easy cards after a week or more — so your revision time goes to the A-Level Computer Science cards you're closest to forgetting.

Get personalised help with A-Level Computer Science — Data Structures — Trees, Graphs and Hash Tables. Book a A-Level Computer Science tutor →