## Beginning Data Structures Using CThis book is intended for those students who want to learn Data Structure programs in C language. A beginner of the Data structures, who has some basic knowledge of C, could find this book interesting and simple. Every program has a proper step by step explanation of each line of code. It contains the practical implementation of stacks, queues, linked lists, trees, graphs, searching and sorting techniques. In addition, recursion has been explained in an easy manner with the numerous examples. Topics, which are covered in this book, are: 1.INTRODUCTION TO DATA STRUCTURES 2.STACKS 3.QUEUES 4.RECURSION 5.LINKED LISTS 6.STACKS AND QUEUES USING LINKED LISTS 7.TREES 8.GRAPHS 9.SEARCHING 10.SORTING |

### What people are saying - Write a review

User Review - Flag as inappropriate

it's a very good book

User Review - Flag as inappropriate

All 6 reviews »jana

### Other editions - View all

### Common terms and phrases

1.Insert an edge 10.delete before element 2.add at end 2.Delete an edge 3.add after element 3.Display the graph 4.add before element 5.traverse in order 6.traverse in reverse 7.delete at beginning 8.delete at end 9.count 9.delete after element adjacency matrix beginning 2.add beginning 8.delete binary search tree break bubble sort Circular Queue complete binary tree Delete an element deque directed graph edge 2.Delete edge 3.Display element 10.delete element 11.sort 12.exit element 4.add element 5.traverse element\n end 3.add end 9.delete endmain enter choice 1.add Enter choice 1.Insert enter item Enter second node exit function Hamiltonian cycles include<stdio.h Insert an element insertion sort int item last node leaf nodes left child linked list malloc matrix node 3 Enter node ptr order 6.traverse postfix prev printf printf(“Enter printf(“Input Priority Queue queue reverse order 7.delete right child shell sort sorted starting node subfiles subtree temp topological sort traverse vertex void main