Binary search trees (BSTs) are very simple to understand. We start with a root node with value x, where the… Read More
As you may of guessed the cases that we use for deletion in a doubly linked list are exactly the… Read More
Linked lists can be thought of from a high level perspective as being a series of nodes. Each node has… Read More
Testing All the data structures and algorithms have been tested using a minimised test driven development style on paper to… Read More
Tips for working through the examples As with most books you get out what you put in and so we… Read More
Object oriented concepts For the most part this book does not use features that are speci¯c to any one language.… Read More
