The ordering with binary tree is a sorting algorithm, which orders its elements using a binary search tree. It is based on gradually building the binary tree introducing each of the elements, which will be already sorted. Then, you get the list of the elements sorted by going through the tree in inorder. Complexity

Inserting elements in a binary search tree has a complexity O (log n). Then, adding n elements to any tree results in a complexity O (n log n). In addition, traversing the elements of the tree in inorder has complexity O (n). characteristics

wiki