From ba74c7efbe98df10cadc533a4710c9a85b1f0708 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 24 Mar 2025 18:01:49 -0400 Subject: [PATCH] line break --- lectures/19_trees_II/README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/lectures/19_trees_II/README.md b/lectures/19_trees_II/README.md index 7e4cf44..5725958 100644 --- a/lectures/19_trees_II/README.md +++ b/lectures/19_trees_II/README.md @@ -96,6 +96,7 @@ easy to show that iterating through a tree storing n nodes requires O(n) operati Exercise: [method 1] Write a fragment of code that given a node, finds the in-order successor using parent pointers. Be sure to draw a picture to help you understand! + ![alt text](ds_set_parent_ptrs.png "ds set parent ptrs") Exercise: [method 2] Write a fragment of code that given a tree iterator containing a pointer to the node and a