noah/Red-Black_Tree
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Revert "Display"

Browse Source 
This reverts commit 21a24ae723373aa59e2871decc70a40395dfff61.
This commit is contained in:
Noah L. Schrick 2022-04-20 23:04:24 -05:00
parent 21a24ae723
commit c8de715ebe
1 changed files with 0 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
Schrick-Noah_Project-Writeup.tex
View File

@ -66,7 +66,6 @@ The delete function takes two arguments. The first is a pointer to a node, and s
The cleanup function was implemented by following the pseudocode of the three cases discussed during lecture, and the function takes a sole argument, which is a pointer to the node currently being examined. The function makes use of a while loop that checks if the current node and its parent are both red. Each case respectively calls the left and right rotate as necessary. The cleanup function was implemented by following the pseudocode of the three cases discussed during lecture, and the function takes a sole argument, which is a pointer to the node currently being examined. The function makes use of a while loop that checks if the current node and its parent are both red. Each case respectively calls the left and right rotate as necessary.
\subsubsection{Display} \subsubsection{Display}
Due to the saturated nature of binary tree displays, a novel approach for a print was unlikely. This program implemented an approach for a terminal-based print based on an existing method, and references its origin in the code itself. It makes use of recursion and a custom struct called ``Trunks", that has a pointer member to the previous trunk, and a string member that corresponds to a specific string for a left or right child.
\section{Results} \section{Results}
\subsection{Part 1.B: ``Tree 1"} \subsection{Part 1.B: ``Tree 1"}