Binary Tree

Definition

• Is a Tree like data structure where every node has at most two children.
  • There is one left and right child node.

What you need to know

• Designed to optimize searching and sorting.
• A degenerate tree is an unbalanced tree, which if entirely one-sided, is essentially a linked list.
• They are comparably simple to implement than other data structures.