This article contains algorithms of Sequential Search, Binary Search, Selection Sort, Bubble Sort, Merge Sort, Quick Sort, Insertion Sort, creating Heap, processing Heap, Creating Singly Linked List, Inserting a Node using Singly Linked List, Deleting a Node using Singly Linked List, Creating Stack (lifo) using Singly Linked List, Pushing a Node above the top of stack using Singly Linked List, Poping the Topmost element of stack using Singly Linked List, Creating Queue(fifo) using Singly Linked List, Pushing a Node at the end of queue using Singly Linked List, Poping the Topmost element of queue using Singly Linked List, Creating Circular Doubly Linked List, Inserting a new node after or before any particular node in Circular Doubly Linked List, Deleting a particular node in Circular Doubly Linked List, Inserting an element into the stack using array, Deleting an element from the stack using array, Inserting an element into the queue using array, Deleting an element from the queue using array, Inserting an element from the circular queue using array, Deleting an element from the circular queue using array, Unparenthesis infix to suffix expression, Parenthesis infix to suffix expression, Creating a Binary Tree, Copying a Binary Tree, Inserting a node from a Binary Tree, Deleting a node from a Binary Tree, Recursive algorithm for traversing a binary tree in inorder, Recursive algorithm for traversing a binary tree in preorder, Recursive algorithm for traversing a binary tree in postorder, traversing a binary tree in inorder, traversing a binary tree in preorder, traversing a binary tree in postorder, converting a general tree to a binary tree.