| Implementation of data structures | |
You must refresh your knowledge on data structures from the AS course. Click here to view the AS material. This part of the course will introduce a new data structure (binary tree) and look at how data structures can be implemented using arrays. Finally you will look at some classic manipulation algorithims.
|
|
| Pointers | |
| Creating a linked list | |
| Adding to a linked list | |
| Removing from a linked list | |
| Implementing a stack | |
| Binary tree - over view | |
| Adding to a binary tree | |
| Removing from a binary tree - the three cases | |
| Serial search | |
| Binary search | |
| Bubble sort | |
| Insertion sort | |
| Quick sort | |
| Merge sort | |
| Links |
Custom Search