Rev 3386 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 3386 | Rev 4153 | ||
|---|---|---|---|
| Line 41... | Line 41... | ||
| 41 | * @li Difference of heights of the left and the right subtree of every node is |
41 | * @li Difference of heights of the left and the right subtree of every node is |
| 42 | * one at maximum. |
42 | * one at maximum. |
| 43 | * |
43 | * |
| 44 | * Every node has a pointer to its parent which allows insertion of multiple |
44 | * Every node has a pointer to its parent which allows insertion of multiple |
| 45 | * identical keys into the tree. |
45 | * identical keys into the tree. |
| 46 | * |
46 | * |
| 47 | * Be careful when using this tree because of the base atribute which is added |
47 | * Be careful when using this tree because of the base atribute which is added |
| 48 | * to every inserted node key. There is no rule in which order nodes with the |
48 | * to every inserted node key. There is no rule in which order nodes with the |
| 49 | * same key are visited. |
49 | * same key are visited. |
| 50 | */ |
50 | */ |
| 51 | 51 | ||