Divide-Conquer

Convert a sorted array to a height-balanced binary search tree.

Merge k sorted linked lists into one sorted linked list

Sort a linked list in O(n log n) time using constant extra space