Skip to content

Update redblack.tex (Issue #84) #86

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
LautaroLobo12 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update redblack.tex (Issue #84) #86

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions latex/redblack.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -236,8 +236,8 @@ \subsection{Red-Black Trees and 2-4 Trees}
at most $\log (#n#+1)$. Now, every root to leaf path in the 2-4 tree corresponds
to a path from the root of the red-black tree $T$ to an external node.
The first and last node in this path are black and at most one out of
every two internal nodes is red, so this path has at most $\log(#n#+1)$
black nodes and at most $\log(#n#+1)-1$ red nodes. Therefore, the longest path from the root to any \emph{internal} node in $T$ is at most
every two internal nodes is red, so this path has at most $\log(#n#+1)+1$
black nodes and at most $\log(#n#+1)$ red nodes. Therefore, the longest path from the root to any \emph{internal} node in $T$ is at most
\[
2\log(#n#+1) -2 \le 2\log #n# \enspace ,
\]
Expand Down