The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
1k views

in DS by Active (4k points)
edited by | 1k views
0
in a sight,it looks like AVL tree, i have not solved though!!
+1
yes it is ,
but can you please give me any trick or pattern how to solve such problems in less time

1 Answer

+2 votes
look in AVL tree, we know that both side have to be balanced, i.e balance factor -1,0,1 ..now in the question look at the line,where it is returning -1 when abs(left-right>1) means balance factor above 1 [-1 of Bf  is also 1, coz absolute is taken]

that means it is not AVL..

Note;for this kind of Code snippet,generally the if condition resembels familiar Tree properties!
by Boss (17.9k points)
0
I just wanted to confirm this -
output or return value should be -1  as they mentioned ,
so we will check if condition only abs(left-right>1) this one bcs this is giving only -1 right ,
and difference should be greater than 1, so its not balanced.
Answer should be option C.
Am i right??
0
As far as i am concerend!!

How was the CBT 1?   i mean difficulty?
0
Not up to the GATE Level .
0
can you explain difference between option c and d
0
i a myself confused!! i
0
Why not D ?
0
I marked option D too. They say it's C. I think they framed the wrong options.
0
No , i got it Now .
See AVL is height Balanced  BST . But they give size balanced tree.
Both are different . So, option C correct .
0
But in option d,  the definition they gave for size balanced tree,  isn't it same as an AVL tree?

Related questions

0 votes
1 answer
7
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,092 questions
55,237 answers
190,755 comments
85,991 users