| Метод | Описание | |
|---|---|---|
| __construct ( $key, $value, Medusa\Tree\BinaryTree $left, Medusa\Tree\BinaryTree $right ) | ||
| add ( $key, $value ) | ||
| contains ( $key ) | ||
| createEmpty ( ) | ||
| getIterator ( ) | ||
| height ( ) | ||
| isEmpty ( ) | ||
| key ( ) | ||
| left ( ) | ||
| lookup ( $key ) | ||
| remove ( $key ) | ||
| right ( ) | ||
| search ( $key ) | ||
| value ( ) |
| Метод | Описание | |
|---|---|---|
| balance ( Medusa\Tree\BinaryTree $t ) | ||
| compare ( $key1, $key2 ) | ||
| doubleLeft ( Medusa\Tree\BinaryTree $t ) | ||
| doubleRight ( Medusa\Tree\BinaryTree $t ) | ||
| isLeftHeavy ( Medusa\Tree\BinaryTree $t ) | ||
| isRightHeavy ( Medusa\Tree\BinaryTree $t ) | ||
| makeBalanced ( Medusa\Tree\BinaryTree $t ) | ||
| removeCurrentNode ( ) | ||
| removeLastAndPlaceAtTheTop ( ) | ||
| rotateLeft ( Medusa\Tree\BinaryTree $t ) | ||
| rotateRight ( Medusa\Tree\BinaryTree $t ) |
| public __construct ( $key, $value, Medusa\Tree\BinaryTree $left, Medusa\Tree\BinaryTree $right ) | ||
| $left | Medusa\Tree\BinaryTree | |
| $right | Medusa\Tree\BinaryTree | |
