For a balanced tree , use either DLL or array ; same thing .
On Wed, Aug 8, 2012 at 10:29 PM, Navin Kumar wrote:
> @vaibhav : yes it will be a balanced BST.
>
>
> On Wed, Aug 8, 2012 at 11:29 AM, vaibhav shukla
> wrote:
>
>> @Navin
>>
>> By your algo of starting with the middle node,I guess a ba
@vaibhav : yes it will be a balanced BST.
On Wed, Aug 8, 2012 at 11:29 AM, vaibhav shukla wrote:
> @Navin
>
> By your algo of starting with the middle node,I guess a balanced BST would
> be created. Is it ?
>
>
> On Wed, Aug 8, 2012 at 1:24 AM, Navin Kumar wrote:
>
>> 1. Convert your Binary tree
@Navin
By your algo of starting with the middle node,I guess a balanced BST would
be created. Is it ?
On Wed, Aug 8, 2012 at 1:24 AM, Navin Kumar wrote:
> 1. Convert your Binary tree into doubly linked list.
> 2. Sort the linked list using merge sort
> 3. Build BST using doubly linked list by ea
1. Convert your Binary tree into doubly linked list.
2. Sort the linked list using merge sort
3. Build BST using doubly linked list by each time selecting middle node
and recursively calling left part of linked list and right part of linked
list.
On Tue, Aug 7, 2012 at 10:23 PM, vaibhav shukla wro
Hi all
The problem is to convert a binary tree into Binary Search Tree
My approach was :
1. Store the Inorder traversal of BT in an array.
2. Sort the array in ascending order.
3. Again do inorder traversal and write the Node's data from array one by
one.
This approach takes O(n) extra space.
