Created
March 22, 2018 17:32
-
-
Save dannysperry/00cce731ce2053d81671de15cf2602a7 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| A binary tree is a tree of Nodes where every node has a value and up to two children Nodes. | |
| The children Nodes can be called @left and @right, @first and @last, or something similar | |
| Perfect Binary Tree - If a tree of nodes has no empty node spaces on all it's levels | |
| They contain a value | |
| They can refer to another node to the left with a smaller value | |
| They can refer to another node to the right with a larger value |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment