Skip to content

Latest commit

 

History

History
32 lines (26 loc) · 786 Bytes

module06-quiz.md

File metadata and controls

32 lines (26 loc) · 786 Bytes

Module 6: Trees and Graphs

Topics Covered:

  • Binary Trees (DFS, BFS)
  • Binary Search Trees
  • Graph Traversals (DFS, BFS)
  • Implicit Graphs

Key Problems:

  • Minimum Depth of Binary Tree
  • Max Area of Island
  • Word Ladder

Quiz:

  1. What is the time complexity of traversing a binary tree using depth-first search (DFS)?

    • a) O(n log n)
    • b) O(n)
    • c) O(log n)
    • d) O(1)

  2. In a breadth-first search (BFS) traversal of a graph, what is the time complexity if V is the number of vertices and E is the number of edges?

    • a) O(V + E)
    • b) O(V log E)
    • c) O(V^2)
    • d) O(V + E^2)

  3. In a binary search tree, where is the smallest element located?

    • a) At the root
    • b) In the leftmost node
    • c) In the rightmost node
    • d) At any leaf node