Sorting - Bubble sort - Selection sort - Insertion sort - Shell sort – Radix sort. Searching- Linear Search - Binary Search. UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES UNIT IV NON LINEAR DATA STRUCTURES - GRAPHSĭefinition – Representation of Graph – Types of graph - Breadth-first traversal - Depth-first traversal – Topological Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs. Tree ADT – tree traversals - Binary Tree ADT – expression trees – applications of trees – binary search tree ADT –Threaded Binary Trees- AVL Trees – B-Tree - B+ Tree - Heap – Applications of heap.
UNIT III NON LINEAR DATA STRUCTURES – TREES Stack ADT – Operations - Applications - Evaluating arithmetic expressions- Conversion of Infix to postfix expression - Queue ADT – Operations - Circular Queue – Priority Queue - deQueue – applications of queues.
UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation ––singly linked lists- circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All operations (Insertion, Deletion, Merge, Traversal).
