โ† Deutsche Bank questions
CodingReported in a candidate post, Jul 2025

Explain merge sort with an example and its time complexity

Filed under Deutsche Bank

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.

Related Deutsche Bank questions

Collected from public candidate posts and coding forums. Updated Nov 2026.