Data structures & algorithms

What is Binary tree?

A binary tree is a hierarchical structure where each node has at most two children, called left and right. A binary search tree keeps smaller keys on the left and larger keys on the right, giving O(log n) search when it is balanced.