since you know the size, you know exactly the path to the new node.
Sent from Nexus one
On Dec 21, 2010 11:10 PM, "mo...@ismu" wrote:
>
> it takes O(n) and also O(n)extra space(queue)
>
>
> On Wed, Dec 22, 2010 at 12:37 PM, Saurabh Koar
wrote:
>>
>> Find the first node whose left child is NULL o
it takes O(n) and also O(n)extra space(queue)
On Wed, Dec 22, 2010 at 12:37 PM, Saurabh Koar wrote:
> Find the first node whose left child is NULL or Right child is NULL
> using BFS.(As the tree is complete,all nodes before this will have two
> children).Insert at that node.
>
> --
> You received
Find the first node whose left child is NULL or Right child is NULL
using BFS.(As the tree is complete,all nodes before this will have two
children).Insert at that node.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, s
If there are two structs, TreeNode and Tree. TreeNode contains 3
elements, data, lChild and rChile. Tree contains 2 elements, int size
and TreeNode *root. The tree is a complete tree. So how to find a
O(logN) approach to insert a new node
--
You received this message because you are subscribed to
