Given a binary search tree, you are asked to convert it to a linked list. Yet, we would still like to be able to search elements in the BST, so the elements in the linked list should be in increasing order.
The input is handled automatically, you don’t need to do anything. It’s guaranteed that the input binary tree is valid.
The program should return the root of the linked list.