JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

line break

Browse Source
This commit is contained in:
Jidong Xiao
2025-03-24 18:01:49 -04:00
committed by JamesFlare
parent 6198e34b84
commit ba74c7efbe
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
lectures/19_trees_II/README.md
View File

@@ -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. 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! Be sure to draw a picture to help you understand!
![alt text](ds_set_parent_ptrs.png "ds set parent ptrs") ![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 Exercise: [method 2] Write a fragment of code that given a tree iterator containing a pointer to the node and a