3. BST to sorted LL #

Created Sunday 09 February 2020

Two approaches are possible:

• Naive approach time is O(n^2^)
• Other approach takes a the neary the same memory but O(n) time. Return pair.