Binary Tree

Binary trees are trees wherein each node has at most 2 children.

graph TD;
  a-->b & c;
  b-->d & e;
  c-->f;

Implementation

Usually binary trees are implemented as a node with two pointers to its children.