IB Computing: Data structures in Java

You are here:

Data structures in Java

The pages in this section cover the implementation of dynamic data structures and algorithms using Java . The rest of Topic 5 is also presented here from a Java point of view.

The theoretical aspects will be considered in theory topic 5.

Topics:

Link	topic
Object references	Introduces the concept of references, nodes and simple lists.
Nodes and lists	Introducing simple linked lists
Dynamic Lists	More on Simple lists, Double and Circular examples.
Stacks	As a dynamic data structure using reference mechanisms.
Queues	As a dynamic Structure using reference mechanisms
Recursion	Methods that call themselves.
Binary Trees	Introduction to Trees and tree traversal.

Links to theory topic 5

The site is partly financed by advertising revenue, partly by online teaching activities and partly by donations. If you or your organisation feel these resouces have been useful to you, please consider a donation, $9.95 is suggested. Please report any issues with the site, such as broken links, via the feedback page, thanks.

Questions or problems related to this web site should be addressed to Richard Jones who asserts his right to be identified as the author and owner of these materials - unless otherwise indicated. Please feel free to use the material presented here and to create links to it for non-commercial purposes; an acknowledgement of the source is required by the Creative Commons licence. Use of materials from this site is conditional upon your having read the additional terms of use on the about page and the Creative Commons Licence. View privacy policy.

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License. © 2001 - 2007 Richard Jones, PO BOX 246, Cambridge, New Zealand; This page was last modified: July 28, 200823, 2008