CLOSEST BINARY SEARCH TREE VALUE II | LEETCODE # 272 | PYTHON SOLUTION

[@deepankagrawal5353]

We can also do Inorder traversal to make an array (which will be sorted) and then use two pointers to decide if start is closer than end.

[@annlaosun6260]

yeah. That is what I am thinking too

[@stouser1296]

U deserve way more subs

[@rsKayiira]

Great video. I wish you had a video for question Closest Binary Search tree Value LC 270 as well. Doing it in optimal time isn't easy

[@alibeccio]

It's a BST, bro. When you are required to find a number in a BST, just use binary search.

[@vigneshsivashanmugam531]

Really you are doing great. Keep up the work. Expecting lot more content from you. I would suggest you to take unique variety of problems(which we might missed to explore) in different topics along with repeatedly asked questions. Also as a future suggestion, you can have a simple dry run(1-2 mins) with example case before you code. Again saying ,you're doing great.

[@crackfaang]

In a real interview I most certainly would and I actually tell people to do this as part of my algorithm for answering any interview question. Unfortunately I see the video analytics for these videos and most people just skip to the code so it’s not a good use of my time to dry run it. Anyone who wishes to do so can do it on their own time

[@kgdev3525]

"I don't waste my time with this type of nonsense "😂😂😂 , Love your content bro

[@crackfaang]

Haha I call it how it is. No need to bullshit you guys 😂

[@alibeccio]

What about the follow up sir? It said to solve it in less than O(n) runtime.

[@subee128]

Thank you so much

[@sharathkumar8338]

Hi Cracking FAANG hope you are doing well. Could you please upload videos on heaps and hashmaps?? i'm kind of weak in those concepts. I have solved more problems on trees and linkedList so far. So trying to focus more on graphs, heaps and hashmaps. In addition to amazon could not even clear first round of samsung R & D 🥲.