Data Structures and Algorithms Notes
Prepared by: Alex Carter
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
1. Data Structures
• Organize and store data efficiently.
2. Arrays
• Fixed-size linear collection.
• Operations: Insert, Delete, Search.
3. Linked Lists
[Diagram: Singly Linked List]
Head → Node1 → Node2 → NULL
4. Stack and Queue
• Stack: LIFO
• Queue: FIFO
5. Trees
• Binary Tree, BST, AVL Tree.
6. Graphs
• Represented by adjacency list or matrix.
• Traversal: BFS, DFS.
