This is an example of an unbalanced binary search tree. A binary tree is structured conceptually as a hierarchy of nodes descending downward from a common root, where each node has two children: left and right. For example, suppose the numbers 7, 5, 9, 3, 11, 6, 12, 14 and 15 were inserted into a BinaryTree. The structure would be as below. Note that this binary tree is not balanced, which can be a desirable characteristic for guaranteeing the performance of lookups - see AVL trees for an example of a self-balancing binary search tree.
7 / \ 5 9 / \ \ 3 6 11 \ 12 \ 14 \ 15
Option Explicit Public left As BinaryTreeNode Public right As BinaryTreeNode Public key As Variant Public value As Variant