search trees

[@darshanadarkar8033]

10:46 there is one error for minval the if condition should be like self.left.value == None. Because if there is a value for node then there is a left and right nodes even, according to the code described for creating nodes. So, the only condition for checking if its a extreme left is to see self.left.value. Same thing goes for maxval.

[@bishtman12]

Agree, another to do it could be: self.left.left == None, return self.left.value

[@SidharthShambu]

How many really understood this?

[@adityawadikar9326]

True brother...

[@saiprasad3403]

I didn't understand bro

[@PG03TheGod]

Neh

[@nikhilsrivastava2309]

the code had some errors this is the complete corrected code

[@P_Narendra]

5:56

[@shobhitchaturvedi4866]

Excellent Presentation

[@siddharth.chandani]

17:52 WHY IN ELIF CONDITION WE ARE CHECKING ONLY self.left.isempty() ? WE SHOULD CHECK FOR self.right.isempty() ALSO IF ANYONE KNOW THIS PLEASE EXP.

[@Someshsunariwal]

def isempty(self): return self.value == None give me the AttributeError: 'Tree' object has no attribute 'value'

[@shreekrishnapaithane9058]

muze bhi aaya error same

[@saulgoodman980]

you have to have a constructor