Binary Tree

Definition

It is a collection of nodes that are connected by edges and has a hierarchical relationship between the nodes.

Rule of Binary Trees

A tree is considered binary trees if it has below properties:

1. At most 2 children per node
2. Exactly 1 root
3. Exactly 1 path between root and any node
4. There must be no duplicate nodes

Depth First Values