| |||
| Durchlauf vor der Sortierung (The act of recursively traversing a non-empty binary tree by visiting the root node first, then the left subtree, then the right subtree) | |||
| |||
| Durchlauf vor der Sortierung (The act of recursively traversing a non-empty binary tree by visiting the root node first, then the left subtree, then the right subtree) | |||
