Page 7 - Data Structures Interactive Book
P. 7
7.2.3 Traversal Techniques (Inorder, Preorder, Postorder) ..................................... 63
7.3 Binary Search Trees (BST) .................................................................................... 64
7.3.1 Definition and Operations ............................................................................... 65
7.3.2 Insertion and Deletion in BST ........................................................................ 65
7.3.3 Searching in BST ............................................................................................ 65
7.4 Advanced Trees ...................................................................................................... 65
7.4.1 AVL Trees ...................................................................................................... 66
7.4.2 B-Trees ............................................................................................................ 66
7.4.3 Heap Trees ...................................................................................................... 66
7.5 Applications of Trees ............................................................................................. 66
7.6 Limitations of Trees ............................................................................................... 67
7.7 Summary ................................................................................................................ 67
7.8 Exercise .................................................................................................................. 68
CHAPTER 8 GRAPHS ..................................................................................................... 70
8.1 Introduction to Graphs ........................................................................................... 71
8.1.1 Definition and Characteristics ........................................................................ 71
8.1.2 Terminology (Vertices, Edges, Degree, Path, Cycle) ..................................... 71
8.1.3 Types of Graphs (Directed, Undirected, Weighted, Unweighted).................. 71
8.2 Representation of Graphs ...................................................................................... 72
8.2.1 Adjacency Matrix ........................................................................................... 72
8.2.2 Adjacency List ................................................................................................ 73
8.2.3 Comparison of Representations ...................................................................... 74
8.3 Graph Traversal Techniques ................................................................................ 74
8.3.1 Breadth-First Search (BFS) ............................................................................ 75
8.3.2 Depth-First Search (DFS) ............................................................................... 76
7
