diff options
| author | Thomas Schmucker <ts@its1.de> | 2020-08-07 13:14:21 +0200 |
|---|---|---|
| committer | Thomas Schmucker <ts@its1.de> | 2020-08-07 13:14:21 +0200 |
| commit | a491309224fe206fbea8000d6989d4d5b7fa60d6 (patch) | |
| tree | 37a4dda4f44a4e91c0e6ba48c891a380d1015a9d /tree.c | |
| parent | 87d83e87b6da4036149b73c9b9b6a6946fd6acc7 (diff) | |
| download | data-structures-a491309224fe206fbea8000d6989d4d5b7fa60d6.tar.gz data-structures-a491309224fe206fbea8000d6989d4d5b7fa60d6.tar.bz2 data-structures-a491309224fe206fbea8000d6989d4d5b7fa60d6.zip | |
Vereinfache Code
Mit der for-Schleife statt einer while-Schleife hat die Variable curr
einen kleineren Sichtbarkeitsbereich.
Diffstat (limited to 'tree.c')
| -rw-r--r-- | tree.c | 5 |
1 files changed, 2 insertions, 3 deletions
| @@ -62,10 +62,9 @@ tree_insert(struct tree_node *tree, T key) | |||
| 62 | struct tree_node * | 62 | struct tree_node * |
| 63 | tree_insert_it(struct tree_node *root, T key) | 63 | tree_insert_it(struct tree_node *root, T key) |
| 64 | { | 64 | { |
| 65 | struct tree_node *parent = NULL, | 65 | struct tree_node *parent = NULL; |
| 66 | *curr = root; | ||
| 67 | 66 | ||
| 68 | while ( curr != NULL ) { | 67 | for ( struct tree_node *curr = root; curr != NULL; ) { |
| 69 | parent = curr; | 68 | parent = curr; |
| 70 | 69 | ||
| 71 | if ( key < curr->key ) { | 70 | if ( key < curr->key ) { |
