2-3 Tree: Deleting Steps if neighbour has 3 keys:
Note 1: ETH::A&D
Deck: ETH::A&D
Note Type: Horvath Classic
GUID:
modified
Note Type: Horvath Classic
GUID:
m3`Qbb~x?c
Before
Front
Back
2-3 Tree: Deleting Steps if neighbour has 3 keys:
Our current node adopts one of the children. The separators have to be updated (one is given with the adopted child)
After
Front
2-3 Tree: Deleting Steps if neighbour has 3 keys:
Back
2-3 Tree: Deleting Steps if neighbour has 3 keys:
Our current node adopts one of the children. The separators have to be updated by “rotating them”. The parent sep moves with the adopted and the left sep becomes the new parent).
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Back | Our current node adopts one of the children. The separators have to be updated |
Our current node adopts one of the children. The separators have to be updated by “rotating them”. The parent sep moves with the adopted and the left sep becomes the new parent).<br><img src="paste-bd8f4c10d3d0aaa08619b4e358673f9ff6b134a0.jpg"> |
Note 2: ETH::A&D
Deck: ETH::A&D
Note Type: Horvath Cloze
GUID:
modified
Note Type: Horvath Cloze
GUID:
yg-tkTB|,7
Before
Front
{{c1:: \(\sum_{i = 1}^{n} i\log(i)\)}} \(\leq\) {{c2::\(\sum_{i = 1}^n n \log(n) = n^2 \log n\) (Sum)}}
Back
{{c1:: \(\sum_{i = 1}^{n} i\log(i)\)}} \(\leq\) {{c2::\(\sum_{i = 1}^n n \log(n) = n^2 \log n\) (Sum)}}
After
Front
{{c1:: \(\sum_{i = 1}^{n} i\log(i)\)}} \(\leq\) {{c2::\(\sum_{i = 1}^n n \log(n) = n^2 \log n\)}} (Sum)
Back
{{c1:: \(\sum_{i = 1}^{n} i\log(i)\)}} \(\leq\) {{c2::\(\sum_{i = 1}^n n \log(n) = n^2 \log n\)}} (Sum)
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Text | {{c1:: \(\sum_{i = 1}^{n} i\log(i)\)}} \(\leq\) {{c2::\(\sum_{i = 1}^n n \log(n) = n^2 \log n\) |
{{c1:: \(\sum_{i = 1}^{n} i\log(i)\)}} \(\leq\) {{c2::\(\sum_{i = 1}^n n \log(n) = n^2 \log n\)}} (Sum) |