/* Ajith - Syntax Higlighter - End ----------------------------------------------- */

Data Structures

Design and Analysis of Algorithms

Singly Linked List

01 - Implementation of Singly Linked List.
02 - Deleting a Node from Singly Linked List.
03 - Reversing a Singly Linked List.
04 - Detecting a Loop in Singly Linked List - Tortoise and Hare.
05 - Finding first node in a Loop in Singly Linked List
06 - Finding Nth node from end of a Singly Linked List.

C Program - C code for Singly Linked List.

Doubly Linked List
01 - Doubly Linked List 
02 - Creating a Node in Doubly Linked List
03 - Deleting a Node in Doubly Linked List.


Stack

01 - All about stacks.
02 - Stack implementation using Arrays.
03 - Stack implementation using Singly Linked List.
04 - Checking Balance of Symbols in a expression.
05 - Conversion from Infix to Postfix.

Queues


6 comments :

  1. hey pls update the page for circular singly linked list..its a very humble request. All your programs in C and their clear-cut interpretation has been very very helpful. Thank you so much.

    ReplyDelete
    Replies
    1. circular linked list:

      last->next_ = first_->prev_

      you're welcome.

      Delete
  2. Hi,

    Thanks a lot for publishing these content. It's been VERY useful for me on my C learning process. Thank you very much!

    ReplyDelete
  3. I can see the heading Queues but no subtopics inside it.Are there no subtopics under this or I've a problem with my browser.Please reply as I've read all the previous topics and dying to read the topic Queues.

    ReplyDelete
  4. This blog awesome and i learn a lot about programming from here.The best thing about this blog is that you doing from beginning to experts level.

    Love from

    ReplyDelete

Your comments are moderated