Code-snippets

Basic example of data structure

Table of contents

1) Linked Lists

2) Stacks

3) Queues

4) Sorting Algorithms

5) Searching Algorithms

---

1) Linked Lists

Singly Linked List

Insert

• Insert element at head (Push)
• Insert element at last of list (Append)
• Insert element after given element
• Insert element before given element

Delete

• Delete element/node by value
• Delete element/node from start of list
• Delete element/node from end of list
• Delete list
• Delete element by index

Miscellaneous

• Reverse List
• Size of List

Doubly Linked List

Insert

• Insert element at beginning of linked list (Push)
• Insert element at ending of linked list (Append)
• Insert element after given element
• Insert element before given element

Delete

• Delete element/node from start of list(first node)
• Delete element/node from end of list(last node)
• Delete element/node by value

Miscellaneous

• Reverse Doubly linked list

Circular Linked List

Insert

• Insert element in empty list
• Insert element at beginning of linked list (Push)
• Insert element at ending of linked list (Append)
• Insert element after given element

Delete

• Delete element/node from start of list(first node)
• Delete element/node from end of list(last node)
• Delete element/node by value

2) Stacks

• Basic operations of stack with fixed size
• Basic operations of stack without fixed size
• Basic operations of stack using linked list

3) Queues

• Basic operations of queue using list
• Basic operations of queue
• Basic operations of queue using linked_list
• Basic operations of queue using circular linked list
• Basic operations of circular queue
• Validate Nested parentheses

4) Sorting Algorithm

• Bubble sort
• Insertion sort
• Selection sort
• Quick sort

5) Searching Algorithm

• Linear search
• Binary search (iterative)
• Binary search (recursive)

---