Largest BST Test Case failed

#1

only one test case passed.

#2

bro ek choti mistake hai
image
ye aisa hoga.

image
image704×26 1.78 KB

1 Like
#3

current data agar left subtree ke max se jayda hai aur right subtree ke min se kam hai tabhi
wo bst banayega.

1 Like
#4

Bhaiya, still 2 test cases failed. But, we have passed 2 test cases tho.

#5

max ko INT_MIN se intialise karo aur min ko INT_MAX se
baaki sab correct hai.

#6

chal gaya, bhaiya. Esa kyun karna hai?

All the test cases passed.

#7

null node ka koi meaning nahi hai right.
to hum uske max aur min me koi aisi value dalenge jo ki easily replace ho jaye kisi aur value se.

example agar-> x=2(Koi random number) aur MIN me INT_MAX hai
to hum ken sakte hai ki min(x,MIN) hamesha x hi hoga kyunki MIN me sabse bada number hai aur saare number usse chote hi honge.
isilye min me INT_MAX use kiya.
same logic max ke liye.
usko INT_MIN se intialise kiya taaki koi bhi value isko replace kar de.
max(INT_MIN,any_number)=any_number

1 Like
#8

Aapko kese pata chala, ki yah change karna hai? Dryrun karke ya kisi aur tarike se.
Mujhe agar problem milta hai kisi code meh, tab meh bas panic karta hu ya tension meh aa jaate hai.
Magr, aap bhut hi peacefully problem ko solve kr lete hai with taking some amount of time. Kese aap sochte hai jab aap koi problem face krte hai?

#9

kuch nahi bhai bus practice , tum mere se accha karoge jab tum mere stage pe aaoge.
bus apna 100% dete jao daily.

1 Like