Page no:36
4
5
6
7
3.7.Circular Linked List & Operation 3.8. Doubly Linked List & Operation 3.9.Doubly Circular Linked List & Operation 3.10.Difference between an array and Linked List 3.11.Generalized Linked List 3.12. Header Linked List Stack 4.1.Introduction 4.2.Definition 4.3.Operation on Stack 4.4.Static & Dynamic Implementation of a Stack 4.5.Application of Stack 4.5.1.Recursion 4.5.2.Infix, Prefix & Postfix expression 4.5.3.Matching Parentheses in an Expression Queue 5.1.Introduction 5.2.Definition of a Queue 5.3.Operation on a Queue 5.4.Static & Dynamic Implementation of Queue 5.5.Types of Queue 5.5.1.Circular Queue 5.5.2.Priority Queue 5.5.3. DEQueue 5.6. Application of Queue 5.6.1.Job Scheduling 5.6.2. Reversing Stack using Queue Tree 6.1.Tree Terminology 6.2.Binary Tree 6.3.Binary Tree Representation 6.4. Binary Search Tree (BST) 6.4.1.Creating a BST 6.4.2.Binary Search Tree Traversal 6.4.2.1.Preorder Traversal 6.4.2.2. Inorder Traversal 6.4.2.3.Postorder Traversal Binary Threaded Tree 7.1.AVL tree 7.2.B tree 7.2.1 introduction to B tree 7.2.2 insertion in B tree
4
1,3,4,5
2
1,3,4,5
4
1,3,4,5
6