projects:proof:populatedifftree
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| projects:proof:populatedifftree [2023/02/27 18:11] – Owen Mellema | projects:proof:populatedifftree [2023/02/27 19:22] (current) – Owen Mellema | ||
|---|---|---|---|
| Line 82: | Line 82: | ||
| There are no more unmatched nodes in the modified tree. | There are no more unmatched nodes in the modified tree. | ||
| + | |||
| + | ==== Scanning for, and handling, deletion ==== | ||
| + | |||
| + | Handling deletions is really simple. | ||
| + | |||
| + | We start at the first node in the original tree, and scan for unmatched nodes. | ||
| + | |||
| + | {{: | ||
| + | |||
| + | {{: | ||
| + | |||
| + | {{: | ||
| + | |||
| + | {{: | ||
| + | |||
| + | When we find one, we mark it as deleted. | ||
| + | |||
| + | {{: | ||
| + | |||
| + | That's literally it - we don't need to actually delete any nodes, we just need a node telling us that we deleted a node. | ||
projects/proof/populatedifftree.1677521498.txt.gz · Last modified: 2023/02/27 18:11 by Owen Mellema
