Originated through my preparation for the exams in modules Object-Oriented Programming and Algorithms and Datastructures.
| Reference | Note |
|---|---|
| Successor | the following element in the list |
| Reference | Note |
|---|---|
| Successor | the following element in the list |
| Predecessor | the element in the list before the current one |
| Reference | Note |
|---|---|
| Parent | the parent element in the tree |
| LeftChild | the element following left |
| RightChild | the element following right |
| Reference/Attribute | Note |
|---|---|
| Parent | the parent element in the tree |
| LeftNeighbour | the element following left |
| RightNeighbour | the element following right |
| Child | the children in a list |
| Degree | amount of children |
| Mark | flag set when lost a child |
| Key | priority of the node |