praxis.ibLog in
B4.1 Fundamentals of ADTsB4.1.3

Construct and apply linked lists: singly, doubly and circular

Construct and apply linked lists: singly, doubly and circular

AHL≈ 60 minCommand term: ConstructPremium

In this lesson

  • Writing node and list classes for singly, doubly and circular linked lists
  • Constructing insertion, deletion, traversal and search operations
  • Ordering reference changes correctly so that no part of a list is lost
  • Applying linked lists to problems such as round-robin turns

This lesson is part of Premium

Every topic has one free lesson. Premium unlocks every interactive lesson, the exam-style questions at the end of each one, and the rest of Praxis IB.

Log in or sign upTry the free lesson: B4.1.1 Properties and purpose of ADTs in programming

What's inside

  1. LearnBuilding blocks
  2. CodeA singly linked list
  3. LabChange the pointers
  4. CodeA doubly linked list
  5. CheckInsert in the middle
  6. CodeA circular list for taking turns
  7. CheckQuick check
  8. ExamWorked exam answer
  9. ReviewMistakes examiners see
  10. Exam practiceExam-style questions

Ends with 3 exam-style questions worth 10 marks, with a self-marking markscheme.