ºÝºÝߣ

algorithm to pop an element from a stack algorithm to push an element in a stack prefix to infix conversion postfix to infix conversion infix to prefix conversion infix to postfix conversion stack applications operations performed on stack stack abstract data type. non-linear data structure types of data structure overview of data structures linear data structure definition of data structures & algorithm selection sort algorithm illustration of selection sort selection sort best case and worst case of insertion sort worst case for selection sort advantages & disadvantages of insertion sort code for selection sort code for insertion sort insertion sort algorithm illustration of insertion sort insertion sort sorting need for sorting array search binary search searching sequential search priority queue representation priority queue algorithm to dequeue() / remove() an element (item example to dequeue algorithm to enqueue() / add () an element example to enqueue queue applications operations performed on queue queue circular linked list searching a doubly linked list deletion from doubly linked list insertion from doubly linked list doubly linked list searching a singly linked list deletion in singly linked list insertion in singly linked list singly linked list linked list and worst case analyses. complexity analyses examp average algorithm and its properties computational complex