Explain merge sort with a worked example and give its time complexity. Follow-up: define a binary tree, a BST and an AVL tree, and give the search complexity of each.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.