i want to apply a technique of sorting the numbers using binary search tree .
Average case of building a tree is O(lg n)
and then if i apply Inorder traversal , i could get sorted output.
So, can this technique be used over others like mergesort , quicksort etc. where the avg case is O(n lg n)???
jk09 0 Newbie Poster
Narue 5,707 Bad Cop Team Colleague
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.