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

adding the diagram

Browse Source
This commit is contained in:
Jidong Xiao
2023-10-30 17:09:38 -04:00
parent 1a459e4dc7
commit 5b8ab189a3
2 changed files with 3 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
lectures/18_trees_II/README.md
View File

@@ -20,6 +20,8 @@ Write the ds set::destroy tree private helper function.
## 18.2 Insert ## 18.2 Insert
![alt text](ds_set_diagram.png "ds set diagram")
- Move left and right down the tree based on - Move left and right down the tree based on
comparing keys. The goal is to find the location to comparing keys. The goal is to find the location to
do an insert that preserves the binary search tree do an insert that preserves the binary search tree
@@ -65,6 +67,7 @@ point to the “in-order predecessor”.
- Unlike the situation with lists and vectors, these predecessors and successors are not necessarily “nearby” - Unlike the situation with lists and vectors, these predecessors and successors are not necessarily “nearby”
(either in physical memory or by following a link) in the tree, as examples we draw in class will illustrate. (either in physical memory or by following a link) in the tree, as examples we draw in class will illustrate.
- There are two common solution approaches: - There are two common solution approaches:
– Each node stores a parent pointer. Only the root node has a null parent pointer. [method 1] – Each node stores a parent pointer. Only the root node has a null parent pointer. [method 1]
– Each iterator maintains a stack of pointers representing the path down the tree to the current node. [method 2] – Each iterator maintains a stack of pointers representing the path down the tree to the current node. [method 2]

BIN
lectures/18_trees_II/ds_set_diagram.png Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 24 KiB