I am studying about Data Structures and I have to build left canonical binary search tree also known as left-balanced binary search tree.
Example:
I have no idea where and how to start building that tree. Can anyone show me how to do it. Maybe on simple example with elements from 1, 2, 3,... to 10.