Microsoft Interview QuestionSoftware Engineer / Developers
- 0of 0 votes
Is this possible?
A BST is given. Without using any extra memory AND WITHOUT USING recursion.
1. Convert the BST into Sorted single Linked List.
2. Convert the Sorted Linked List in (1) to exactly identical original BST.
Suppose tree is:
Team: Ad Center
Interview Type: In-Person