4. Data Structures Part 2

Syllabus Points Covered

Programming fundamentals

Data for software engineering

• Use data structures of arrays, records, trees and sequential files

  • trees

Developing solutions with code

• Implement data structures that support data storage

  • trees

  • hash tables

Chapter Contents

• 4.1. Efficiency
  • 4.1.1. Example
• 4.2. Big-O Notation
  • 4.2.1. Recommended Video (3 minutes)
  • 4.2.2. Time Complexity
  • 4.2.3. Space Complexity
  • 4.2.4. Big-O Details
• 4.3. Big-O and Data Structures
  • 4.3.1. Average Complexities
  • 4.3.2. Worst Case Complexities
• 4.4. Nodes
• 4.5. Linked List
  • 4.5.1. Recommended Video (10 minutes)
  • 4.5.2. Concept
  • 4.5.3. Time Complexity
  • 4.5.4. Space Complexity
• 4.6. Stack
  • 4.6.1. Push
  • 4.6.2. Pop
• 4.7. Binary Search Tree
  • 4.7.1. Recommended Video (6 minutes)
  • 4.7.2. Concept
  • 4.7.3. Time Complexity
  • 4.7.4. Space Complexity
• 4.8. Hash Table
  • 4.8.1. Recommended Video (4 minutes)
  • 4.8.2. Concept
  • 4.8.3. Collision Resolution
  • 4.8.4. Time Complexity
  • 4.8.5. Space Complexity
• 4.9. Extensions