Introduction to Binary Trees

A binary tree is a kind of data structure in which each node has at most two children. Every node of BST has two kids with the smaller one than itself on the left, while the bigger one on the right.

Definitions:

• Root: The topmost node in the tree.
• Leaf: A node with no children.
• Height: The length of the longest path to a leaf.

Illustration of BST:

Learn more about Binary Search Trees on Wikipedia.