Recover Binary Search Tree | Leetcode 99 | BST | Day-19

preview_player
Показать описание
Time Complexity : O(n)
Space Complexity : O(1)


Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)

#DataStructuresAndAlgorithms
#BST
#interviewpreparation
Recover Binary Search Tree solution
Recover Binary Search Tree Leetcode
Recover Binary Search Tree C++
Recover Binary Search Tree Java
Recover Binary Search Tree Python

🔥🔥🔥🔥👇👇👇

Checkout the series: 🔥🔥🔥
LIKE | SHARE | SUBSCRIBE 🔥🔥😊
Рекомендации по теме
Комментарии
Автор

op didi waiting ki kab aayegi video nhi toh aaj streak tut jati :( )

dipanshmalhotra
Автор

The dry run of the code you explained has helped me a lot .
Thanks di..

praddhumnsingh
Автор

As you said, did the dry run 2 times and understood the solution well. thanks for the explanation

ujjwalsingh
Автор

Really helpful videos .. simply love ur explanation... Thanks for this video

kiranmai
Автор

Quick question, on the brute force approch, if you have a incorrect BST as input How do you know what the ideal BST is? Manually sort?

maheshj
Автор

Hey, please recheck once the space complexity of your solution is O(N) and not O(1).

gaurimandot
Автор

nice explanation, but the space for recursion is O(N) in the worst case, problem states to solve in O(1) space.

obulpathi
Автор

solution is not O(1) in space complexity, recursion uses space internally

harshilsavaliya
Автор

Koi yaha bata sakta hai class ka name ka return type use kar sakte hai function ma why??

himanshukaushik
Автор

Video checked!!!
Di video nhi aa rhii Aab aap theak hooo

chronologyofai
Автор

Not very clear with the explanation
Saw this code everywhere on leetcode

manasdeora
visit shbcf.ru