Data Structures19 sections · 729 units
Open in Course

Quiz: Persistent Data Structures

Test your understanding

Persistent Structures Concepts

Why does path copying create only O(log n) new nodes per update in a balanced tree?

  1. A.Because updates only affect leaf nodes
  2. B.Because the tree has O(log n) total nodes
  3. C.Because only nodes on the path from root to the updated node need new copies; other subtrees are shared
  4. D.Because old nodes are deleted after copying
Start the roadmap to answer the quizzes and solve the challenges