Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given a Binary Tree, convert it to Binary Search Tree in such a way that keeps the original structure of Binary Tree intact.

**Example 1:**

**Input:
**1
/ \
** **2 3**
Output: **1 2 3

**Example 2:**

Input:1 / \ 2 3 / 4Output:1 2 3 4Explanation:The converted BST will be 3 / \ 2 4 / 1

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **binaryTreeToBST()** which takes the root of the Binary tree as input and returns the root of the BST. The driver code will print** inorder** traversal of the converted BST.

**Expected Time Complexity:** O(NLogN).

**Expected Auxiliary Space:** O(N).

**Constraints:**

1 <= Number of nodes <= 1000

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Binary Tree to BST

...