Binary trees are special types of trees
that are most commonly used to search over a data space very quickly.
Binary trees are also very fast to insert and delete, much like
linked lists, but finding operations are much faster.
Discussing supported operations
such as add, remove, balance
Implementation of binary trees in
Complete a hands-on exercise such
as converting an array of users to a binary tree for faster searches