shorten names of parameters
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
parent
1ead11e542
commit
5c11ad4fdc
1 changed files with 4 additions and 4 deletions
|
@ -728,7 +728,7 @@ In contrast to the \textit{AVL Rule}, WAVL tree allows us to have (2, 2) nodes p
|
||||||
\end{algorithm}
|
\end{algorithm}
|
||||||
|
|
||||||
\begin{algorithm}
|
\begin{algorithm}
|
||||||
\Proc{$\texttt{fixDelete}(T, x, y, z, reversed, rotateLeft, rotateRight)$}{
|
\Proc{$\texttt{fixDelete}(T, x, y, z, reversed, rotateL, rotateR)$}{
|
||||||
$v \gets y.left$\;
|
$v \gets y.left$\;
|
||||||
$w \gets y.right$\;
|
$w \gets y.right$\;
|
||||||
\If{$reversed$}{
|
\If{$reversed$}{
|
||||||
|
@ -736,7 +736,7 @@ In contrast to the \textit{AVL Rule}, WAVL tree allows us to have (2, 2) nodes p
|
||||||
}
|
}
|
||||||
\BlankLine
|
\BlankLine
|
||||||
\uIf{$w \text{ is 1-child} \land y.parent \neq nil$}{
|
\uIf{$w \text{ is 1-child} \land y.parent \neq nil$}{
|
||||||
$rotateLeft(T, y.parent)$\;
|
$rotateL(T, y.parent)$\;
|
||||||
\BlankLine
|
\BlankLine
|
||||||
$\texttt{promote}(y)$\;
|
$\texttt{promote}(y)$\;
|
||||||
$\texttt{demote}(z)$\;
|
$\texttt{demote}(z)$\;
|
||||||
|
@ -746,8 +746,8 @@ In contrast to the \textit{AVL Rule}, WAVL tree allows us to have (2, 2) nodes p
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
\ElseIf{$w \text{ is 2-child} \land v.parent \neq nil$}{
|
\ElseIf{$w \text{ is 2-child} \land v.parent \neq nil$}{
|
||||||
$rotateRight(T, v.parent)$\;
|
$rotateR(T, v.parent)$\;
|
||||||
$rotateLeft(T, v.parent)$\;
|
$rotateL(T, v.parent)$\;
|
||||||
\BlankLine
|
\BlankLine
|
||||||
$\texttt{promote}(v)$\;
|
$\texttt{promote}(v)$\;
|
||||||
$\texttt{promote}(v)$\;
|
$\texttt{promote}(v)$\;
|
||||||
|
|
Reference in a new issue