Data Structures through C++ - A quick reference

This books starts with an overview on Object Oriented Programming Language C++. After the introduction of C++ we discussed the Linear Data structures - Linked list, Stack, Queue, Circular Queue and Priority queues along with implementation in C++. Under the Non-Linear data structures section, we focused on Trees, Graphs and its representations. Various graph traversals and algorithms such as Prim's, Kruskal's are also included. Searching techniques such as Linear Search, Binary Search and Hashing methods are discussed. Under the Sorting mechanisms we have presented - Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort along with implementation in C++. In Search trees section Binary Search Tree (BST) is discussed along with its implementation. We have introduced the advanced search trees like AVL Trees, B-Trees and Red-Black Trees.

Autorentext

Dr. Ch. V. Raghavendran working as Professor & HOD, Holy Mary Institute of Technology & Science, Bogaram, Hyderabad, India. He published more than 30 papers in the reputed International Journals. He presented number of papers in various National and International Conferences. He authored for four books in Computer Sciences.