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 from a binary search tree
      4. 10.2.4. Why are binary search tree retrievals more efficient than sequential list retrievals?
      5. 10.2.5. Insertion into a binary search tree
      6. 10.2.6. Deletion from a binary search tree
      7. 10.2.7. Drawbacks of a binary search tree
      8. 10.2.8. Counting binary search trees
    3. 10.3. AVL trees: definition and operations
      1. 10.3.1. Definition
      2. 10.3.2. Retrieval from an AVL search tree
      3. 10.3.3. Insertion into an AVL search tree
      4. 10.3.4. Deletion from an AVL search tree
      5. 10.3.5. R category rotations associated with the delete operation
      6. 10.3.6. L category rotations associated with the delete operation
    4. 10.4. Applications
      1. 10.4.1. Representation of symbol tables in compiler design
    5. 10.5. Illustrative problems
  6. Chapter 11. B Trees and Tries
    1. 11.1. Introduction
    2. 11.2. m-way search trees: definition and operations
      1. 11.2.1. Definition
      2. 11.2.2. Node structure and representation
      3. 11.2.3. Searching an m-way search tree
      4. 11.2.4. Inserting into an m-way search tree
      5. 11.2.5. Deleting from an m-way search tree
      6. 11.2.6. Drawbacks of m-way search trees
    3. 11.3. B trees: definition and operations
      1. 11.3.1. Definition
      2. 11.3.2. Searching a B tree of order m
      3. 11.3.3. Inserting into a B tree of order m
      4. 11.3.4. Deletion from a B tree of order m
      5. 11.3.5. Height of a B tree of order m
    4. 11.4. Tries: definition and operations
      1. 11.4.1. Definition and representation
      2. 11.4.2. Searching a trie
      3. 11.4.3. Insertion into a trie
      4. 11.4.4. Deletion from a trie
      5. 11.4.5. Some remarks on tries
    5. 11.5. Applications
      1. 11.5.1. File indexing
      2. 11.5.2. Spell checker
    6. 11.6. Illustrative problems
  7. Chapter 12. Red-Black Trees and Splay Trees
    1. 12.1. Red-black trees
      1. 12.1.1. Introduction to red-black trees
      2. 12.1.2. Definition
      3. 12.1.3. Representation of a red-black tree
      4. 12.1.4. Searching a red-black tree
      5. 12.1.5. Inserting into a red-black tree
      6. 12.1.6. Deleting from a red-black tree
      7. 12.1.7. Time complexity of search, insert and delete operations on a red-black tree
    2. 12.2. Splay trees
      1. 12.2.1. Introduction to splay trees
      2. 12.2.2. Splay rotations
      3. 12.2.3. Some remarks on amortized analysis of splay trees
    3. 12.3. Applications
    4. 12.4. Illustrative problems
  8. References
  9. Index
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset