Skip to page content
Linked Lists and Binary Trees
Computer Science · Chapter 12 · Section C: Inheritance, Interfaces, Polymorphism, Data Structures and Complexity
Not started Not started
Your path through this chapter
Visual lesson Coming soon
Short slides, one idea at a time. We are preparing this chapter's lesson.
Notes Coming soon
Clear chapter notes for quick revision.
Flashcards Coming soon
Quick recall of key terms and facts.
Practice Coming soon
Board-style questions with instant checks.
Chapter test Free
Short and long chapter tests in board pattern, with results and analysis.
Step 5: Not started
Topics 5
- Singly linked list: node structure, creation, traversal and checking emptiness
- Linked list insertion and deletion
- Reversing a linked list; extracting an element or a sublist
- Binary tree terminology: root, internal and external nodes, height, depth, level, size, degree, siblings, subtree, completeness, balancing
- Binary tree traversals: preorder, inorder and postorder