Abstract data structures

Background information

This topic is allocated 23 hours.
Additional information linked to that on standard data structures.

The standard methods that are available are:


If teachers have queries about the methods within the document, they should either post a message on the OCC Forum, or contact Richard Taylor, the Subject Manager.

HL Extension

5.1.1 - 5.1.3 Thinking recursively

Vocabulary includes : recursion, fractals, binary trees
Link
Description
Other comments
Link
Recursive Thinking
A sample chapter from:
Data Structures and Other Objects Using Java, by Michael Main







5.1.4 - 5.1.10 Abstract data structures

Vocabulary includes : two dimensional array, stack, LIFO, push, pop
queue, FIFO, enqueue, dequeue
Link
Description
Other comments
Link
Slide Shows for
Data Structures
Very nice illustrations of linked-lists,
trees, stacks, queues, etc






















5.1.11 - 5.1.17 Linked lists and trees

Vocabulary includes : dynamic, node, pointer, doubly linked, circular, insert, delete,
binary tree, non-binary tree, parent, child, subtree, root, leaf,
traversal, inorder, postorder, preorder
Link
Description
Other comments
















5.1.18 - 5.1.20 Applications

Vocabulary includes : dynamic data-structure, static data--structure
Link
Description
Other comments
















Videos and podcasts

Video including details












Other reading sources


Data Structures and Algorithms Using Java,By William McAllister (c) 2009
- for HL and OOP option, excellent diagrams and straightforward Java code examples


Other current articles