Problem

Submissions

Hints & solutions

Discuss

Flatten BST To A Sorted List

Moderate

0/80

Average time to solve is 30m

Contributed by

105 upvotes

Asked in companies

Problem statement

You have been given a Binary Search Tree (BST). Your task is to flatten the given BST to a sorted list. More formally, you have to make a right-skewed BST from the given BST, i.e., the left child of all the nodes must be NULL, and the value at the right child must be greater than the current node.

A binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a value greater than all the values in the node's left subtree and less than those in its right subtree.

Follow Up :

Can you solve this in O(N) time and O(H)  space complexity?

Detailed explanation ( Input/output format, Notes, Images )

Input Format :

The first line of input contains a single integer T, representing the number of test cases or queries to be run. 

Then the T test cases follow. 

The first line of each test case contains elements in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 in its place.

For example, the input for the tree depicted in the below image would be :

4
2 6
1 3 5 7
-1 -1 -1 -1 -1 -1 -1 -1

Explanation :

Level 1 :
The root node of the tree is 4

Level 2 :
Left child of 4 = 2
Right child of 4 = 6

Level 3 :
Left child of 2 = 1
Right child of 2 = 3
Left child of 6 = 5
Right child of 6 = 7

Level 4 :
Left child of 1 = null (-1)
Right child of 1 = null (-1)
Left child of 3 = null (-1)
Right child of 3 = null (-1)
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 7 = null (-1)
Right child of 7 = null (-1)

The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null (-1).

Note :

The above format was just to provide clarity on how the input is formed for a given tree. 
The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:

4 2 6 1 3 5 7 -1 -1 -1 -1 -1 -1 -1 -1

Output Format :

For each test case, flatten the BST and print the values of the nodes in the level order form.

Print the output of each test case in a separate line.

Note :

You do not need to print anything. It has already been taken care of. Just implement the given function.

Constraints :

1 <= T <= 100
1 <= N <= 5000
0 <= node.data <= 10^9, (where node data != -1)

Where 'N' denotes the number of nodes in the given tree.

Time Limit: 1 second

Sample Input 1

2
10 6 12 2 8 11 15 -1 -1 -1 -1 -1 -1 -1 -1
5 -5 8 -1 -1 -1 -1

Sample Output 1

2 -1 6 -1 8 -1 10 -1 11 -1 12 -1 15 -1 -1
-5 -1 5 -1 8 -1 -1

Explanation for Sample Input 1

For the first test case, the given BST is depicted below.

So, after flattening, the BST is transposed as the below figure.

For the second test case, the given BST is depicted below.

So, after flattening, the BST is transposed as the below figure.

Sample Input 2

2
5 3 7 -1 -1 6 8 -1 -1 -1 -1
2 1 -1 -1 -1

Sample output 2

3 -1 5 -1 6 -1 7 -1 8 -1 -1
1 -1 2 -1 -1

Hint 1

Hint 2

Think of a solution to use the property that the inorder traversal of a BST is always sorted.

Approaches (2)

Approach 1

Approach 2

Brute-Force Approach

Note that the inorder traversal of a BST is always sorted. So, we can traverse the BST in an inorder manner and store the values in an array. Then we create a new node for each element in the array, make its left child NULL and right child equal to the node containing the next element in the array. For the last element, we make both the left and right child NULL.

Time Complexity

O(N), where ‘N’ is the number of nodes in the given BST.

We are traversing the BST only once to store all the values in the array after the inorder traversal. Then, we traverse the array one more time to create the flattened list. Hence, the overall time complexity is O(N).

Space Complexity

O(N), where ‘N’ is the total number of nodes in the given BST.

We are storing the values of all the nodes in an array after the inorder traversal. Hence, the overall space complexity will be O(N).

(100% EXP penalty)

Flatten BST To A Sorted List

Console