+91-8595577826
prepfortech

Data Structures and Algorithms

Data Structures and Algorithms
Annotated Reference with Example
First Edition

Contents of the Book

Introduction

  • 1.1What this book is, and what it isn’t1
  • 1.2Assumed knowledge3
  • 1.3Pseudocode11
  • 1.4Tips for working through the examples13
  • 1.5Book outline15
  • 1.6Testing17
  • 1.7Where can I get the code?19
  • 1.8Final messages21

Data Structures

  • 2.1Linked Lists25
  • 2.2Singly Linked List27
  • 2.3Doubly Linked List39
  • 2.4Summary47

Binary Search Tree

  • 3.0Insertion51
  • 3.2Searching53
  • 3.3Deletion55
  • 3.4Finding the parent of a given node57
  • 3.5Attaining a reference to a node59
  • 3.6Finding the smallest and largest values61
  • 3.7Tree Traversals63

About the Author

author

Granville Barnett

Ph.D candidate
Queensland University of Technology
Microsoft QUT eResearch Centre

Granville is currently a Ph.D candidate at Queensland University of Technology(QUT) working on parallelism at the Microsoft QUT eResearch Centre 1. He also holds a degree in Computer Science, and is a Microsoft MVP. His main interests are in programming languages and compilers. Granville can be contacted viaone of two places: either his personal website(http://gbarnett.org) or hisblog (http://msmvps.com/blogs/gbarnett)