Medusa\Tree\BinaryTree::right PHP Метод

    public function right();

 private function rotateRight(BinaryTree $t)
 {
     if ($t->left()->isEmpty()) {
         return $t;
     }
     return new self($t->left()->key(), $t->left()->value(), $t->left()->left(), new self($t->key(), $t->value(), $t->left()->right(), $t->right()));
 }