A Textbook of Data Structures and Algorithms, Volume 1

Summary of Volume 2

1. Preface
2. Acknowledgments
3. Chapter 8. Trees and Binary Trees
   1. 8.1. Introduction
   2. 8.2. Trees: definition and basic terminologies
      1. 8.2.1. Definition of trees
      2. 8.2.2. Basic terminologies of trees
   3. 8.3. Representation of trees
   4. 8.4. Binary trees: basic terminologies and types
      1. 8.4.1. Basic terminologies
      2. 8.4.2. Types of binary trees
   5. 8.5. Representation of binary trees
      1. 8.5.1. Array representation of binary trees
      2. 8.5.2. Linked representation of binary trees
   6. 8.6. Binary tree traversals
      1. 8.6.1. Inorder traversal
      2. 8.6.2. Postorder traversal
      3. 8.6.3. Preorder traversal
   7. 8.7. Threaded binary trees
      1. 8.7.1. Linked representation of a threaded binary tree
      2. 8.7.2. Growing threaded binary trees
   8. 8.8. Applications
      1. 8.8.1. Expression trees
      2. 8.8.2. Traversals of an expression tree
      3. 8.8.3. Conversion of infix expression to postfix expression
      4. 8.8.4. Segment trees
   9. 8.9. Illustrative problems
4. Chapter 9. Graphs
   1. 9.1. Introduction
   2. 9.2. Definitions and basic terminologies
   3. 9.3. Representations of graphs
      1. 9.3.1. Sequential representation of graphs
      2. 9.3.2. Linked representation of graphs
   4. 9.4. Graph traversals
      1. 9.4.1. Breadth first traversal
      2. 9.4.2. Depth first traversal
   5. 9.5. Applications
      1. 9.5.1. Single source shortest path problem
      2. 9.5.2. Minimum cost spanning trees
   6. 9.6. Illustrative problems
5. Chapter 10. Binary Search Trees and AVL Trees
   1. 10.1. Introduction
   2. 10.2. Binary search trees: definition and operations
      1. 10.2.1. Definition
      2. 10.2.2. Representation of a binary search tree
      3. 10.2.3. Retrieval ...