a
/ \
/ \
b c
/ \ /\
d e fg
for the given tree, the ans depends on the way one
when f and g have been deleted wudnt the last condition left==null&&
right==null be satisfied fr c as well?
On Tue, Aug 9, 2011 at 12:01 AM, sagar pareek wrote:
> Option 3 is correct :-
>
> suppose we have tree
>
>a
>/ \
>
Option 3 is correct :-
suppose we have tree
a
/ \
/ \
b c
/ \ /\
d e fg
now
answer is three although the nodes are delted but the pointer of nodes other
than leaves are not set to null
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
I guess option 1 is correct
Thx,
--Gopi
On Mon, Aug 8, 2011 at 11:07 PM, siddharam suresh
wrote:
> func( Node *node){
>
> if( node->left == NULL && node->right == NULL )
>
> delete(node);
>
> if(node->right != NULL)
>
> func( node->right);
>
> if(node->left != NULL)
>
>func( n
func( Node *node){
if( node->left == NULL && node->right == NULL )
delete(node);
if(node->right != NULL)
func( node->right);
if(node->left != NULL)
func( node->left);
}
for this code option 3 is correct
Thank you,
Siddharam
On Mon, Aug 8, 2011 at 11:03 PM, rajul jain
@aditi , yes you r right... i missed out delete(node) would make parent as leaf
On Mon, Aug 8, 2011 at 11:03 PM, rajul jain wrote:
> This is what i am trying to say to debabrata
>
> On Mon, Aug 8, 2011 at 10:56 PM, aditi garg
> wrote:
>>
>> @debrata : bt remember its a recursive function...once
This is what i am trying to say to debabrata
On Mon, Aug 8, 2011 at 10:56 PM, aditi garg wrote:
> @debrata : bt remember its a recursive function...once the leaf node gets
> deleted thn it will move bak to the node and thn to the left of it
> fr eg
> a
>/\
> b c
>
i feel ans is 1
Thank you,
Siddharam
On Mon, Aug 8, 2011 at 10:56 PM, sukran dhawan wrote:
> deletes all nodes in the tree.basically it tarverses in postorder and when
> it is a leaf it deletes the node
>
> On Mon, Aug 8, 2011 at 10:21 PM, rohit wrote:
>
>> What will the following code snippet
@debrata : bt remember its a recursive function...once the leaf node gets
deleted thn it will move bak to the node and thn to the left of it
fr eg
a
/\
b c
/ \/ \
d e f g
frst g will be deleted...then f thn it wil delete c and so on...i think the
ans
deletes all nodes in the tree.basically it tarverses in postorder and when
it is a leaf it deletes the node
On Mon, Aug 8, 2011 at 10:21 PM, rohit wrote:
> What will the following code snippet do, when is it passed the root of
> a binary tree ?
> func( Node *node){
>
> if(node->right != NULL)
>
after deletion of leaf parent become leaf of parent's parent. so parent of
leaf would also delete I think
On Mon, Aug 8, 2011 at 10:49 PM, Debabrata Das <
debabrata.barunhal...@gmail.com> wrote:
> check this condition
> if( node->left == NULL && node->right == NULL )
> it is true only for leaves
check this condition
if( node->left == NULL && node->right == NULL )
it is true only for leaves node
On Mon, Aug 8, 2011 at 10:46 PM, rajul jain wrote:
> I have also made same answer on first look but read 3rd option correctly it
> say deletion of leaves from right to left not internal nodes.
>
I have also made same answer on first look but read 3rd option correctly it
say deletion of leaves from right to left not internal nodes.
On Mon, Aug 8, 2011 at 10:36 PM, Debabrata Das <
debabrata.barunhal...@gmail.com> wrote:
> i think 3
>
> On Mon, Aug 8, 2011 at 10:32 PM, rajul jain
> wrote:
i think 3
On Mon, Aug 8, 2011 at 10:32 PM, rajul jain wrote:
> got it thanks
>
> On Mon, Aug 8, 2011 at 10:30 PM, Akash Mukherjee wrote:
>>
>> i think its 1 though ...
>>
>> On Mon, Aug 8, 2011 at 10:21 PM, rohit wrote:
>>>
>>> What will the following code snippet do, when is it passed the
what's ans
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this gr
got it thanks
On Mon, Aug 8, 2011 at 10:30 PM, Akash Mukherjee wrote:
> i think its 1 though ...
>
>
> On Mon, Aug 8, 2011 at 10:21 PM, rohit wrote:
>
>> What will the following code snippet do, when is it passed the root of
>> a binary tree ?
>> func( Node *node){
>>
>> if(node->right !=
i think its 1 though ...
On Mon, Aug 8, 2011 at 10:21 PM, rohit wrote:
> What will the following code snippet do, when is it passed the root of
> a binary tree ?
> func( Node *node){
>
> if(node->right != NULL)
>
> func( node->right);
>
> if(node->left != NULL)
>
>func( node-
What will the following code snippet do, when is it passed the root of
a binary tree ?
func( Node *node){
if(node->right != NULL)
func( node->right);
if(node->left != NULL)
func( node->left);
if( node->left == NULL && node->right == NULL )
delete(node);
}
Pick choi
19 matches
Mail list logo
