For our fifth assignment in Systems Programming, we were tasked with building a ternary tree. A ternary tree uses the same ideology as a binary tree, except that every node in a ternary tree contains two key-data pairs instead of one and each node can have up to three children instead of two. We were instructed to make our tree “bushy,” which means that any given Node can only have children if it already contains two key-data pairs.
-Maxwell S. Smith
“The only thing that we know for sure is that we know nothing at all”