wavl/thesis
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases 1 Wiki Activity

shorten names of parameters

Browse source 
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2022-05-15 23:54:35 +02:00
parent 1ead11e542
commit 5c11ad4fdc
Signed by: mfocko
GPG key ID: 7C47D46246790496
1 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
fi-pdflatex.tex
View file

@ -728,7 +728,7 @@ In contrast to the \textit{AVL Rule}, WAVL tree allows us to have (2, 2) nodes p
\end{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$\;
$w \gets y.right$\;
\If{$reversed$}{
@ -736,7 +736,7 @@ In contrast to the \textit{AVL Rule}, WAVL tree allows us to have (2, 2) nodes p
}
\BlankLine
\uIf{$w \text{ is 1-child} \land y.parent \neq nil$}{
$rotateLeft(T, y.parent)$\;
$rotateL(T, y.parent)$\;
\BlankLine
$\texttt{promote}(y)$\;
$\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$}{
$rotateRight(T, v.parent)$\;
$rotateLeft(T, v.parent)$\;
$rotateR(T, v.parent)$\;
$rotateL(T, v.parent)$\;
\BlankLine
$\texttt{promote}(v)$\;
$\texttt{promote}(v)$\;