Binary Trees

The slog entry I am choosing to be marked is titled "Object-Oriented Programming (OOP)"

Dear Blog,

This week, we focused on binary trees. I didn't have too much of a problem with recursion originally, but learning the recursive solution to binary tree problems is something I find quite difficult.

Something important about binary trees is that each "node" can only have at maximum two children. A node is any connecting point of the tree.

Above is an example of a basic binary tree.

There are also binary search trees which we just started learning about. The idea is that every left side of the node is lower and the right side is greater. This makes is easier to sort or search trees because it is much more efficient to ignore the parts we don't want or need. Here is an example of a binary search tree.

Notice how the left side of the node is lesser and the right side is greater.

Thanks for reading this week's post!
Sincerely,

J.M.