HolyDominat的专栏

Sort a linked list in O(n log n) time using constant space complexity. Solution: Merge Sort

Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements fro

Sort a linked list using insertion sort. Solution: Code:

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. Solution: Code:

Given an array where elements are sorted in ascending order, convert it to a height balanced BST. Solution: Code: