Construct a BST for the array - O(nlogn) Traverse the tree and find a node which has minimum difference with either its left or right child in whole of the tree. (Because the required numbers have to be adjacent to each other in a sorted array). - O(n)
=> Total order:O(nlogn) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
