BINARY TREE VERTICAL ORDER TRAVERSAL | PYTHON SOLUTION EXPLAINED | LEETCODE 314 

Thanks mate, really happy you are finding it useful!

Thanks for the kind words. Glad you enjoyed the video

Thank you! Make sure you subscribe so you don’t miss future videos

Sure thing, that’s a fun problem. Make sure you subscribe so you don’t miss the video when it comes out

glad you enjoyed the video! make sure to subscribe if you haven’t already

@pnwrunning: No , on line 10 and 11, min_x = float("+inf") is the usual way to find mimimum value in a list. That way any value compared with +inf will be smaller than it (we are using min_x for calculating minimum) . Similar explanation holds for max_x = float("-inf") , any value would me more than that so we get the correct maximum value among the list. I tried in python editor and though there is restriction that python range function needs int types, above code with floats worked fine as values in them were integers (x coordinates) , so when th min_x = min(x, min_x) was executed, the value stored in min_x was integer and so it's type becomes class int, which works fine for range function arguments.