INORDER PREDECESSOR in Binary Search Tree

INORDER PREDECESSOR in Binary Search Tree.

[ishan_kumar]

Not all heroes wear capes some teach BSTs.

[sagardafle]

Vivekanand Sir, you are just awesome.
I love your dedication for uploading the videos almost daily.
It is nice to see people from India having such keen interest in algorithms.

You can easily get a very very good job here in the US sir.
DS is the most important aspect for any Software Engineering interviews here.

Anyways, thank you for the awesome work.
I hope that your channel gets more famous.

[Baba-Ji-Ka]

you did a great job seriously. i was stuck for 2nd case. and i found this video today.

[chrisisherewhat]

you are doing a great job. I appreciate you for explaining the correctness of the algorithm in the second case. I hope you keep explaining the correctness of all algorithms, if possible. And thanks a lot for creating such a great video in this topic.

[Msd-bkyc]

salute to teachers like you .Student need this kind of teachers

[vasantprabhu]

it was a difficult topic to explain ..in general trees is difficult to teach ... thanks for explaining it well.

[vasanthkumarmunusamy]

Tutorial is useful.But if you discuss about the time and space complexities, it'll be very useful. Thanks:)

[nayankhuman]

your teaching is awesomer sir....#respect

[ramakantasamal]

Can't believe how can someone explain a algorithm in such a simple way... You are the best I have seen so far on youtube for algorithms. you explain things in such a simple language that a 5 year kid can code :D.

[cswalker]

Thank you Vivekanand. You helped me again!

[shibmobileverse]

I think it would be great if you had a board or something where you wrote the complete algo. Looking back I see the bottom right of your white board is very close to the solution of my problem which is:

function inOrderPredecessor(node, target) {
var candidate = null;
while (node) {
if (node.val < target) {
candidate = node.val;
node = node.right;
} else {
node = node.left;
}
}
console.log(candidate)
return candidate;
}

[saharrohani]

You made my life easy. Thank you so much.

[Sudeshna-Pradhan-]

Ohoohoooo what an amazing tutorial....

[sachinrknv]

Hi Vivekanand, Can you make video on convert binary tree to binary search tree.

[xiangwingrace]

You are awesome!!! Great Video!! Thanks!

[NS-efyu]

Could you please upload a video on how to find the maximum sum path of a binary tree?
Here is the full question:
Given a binary tree consisting of nodes with positive integer values, write a method that returns the maximum sum of data values obtained by traversing nodes along a path between any 2 nodes of the tree. The path must originate and terminate at 2 different nodes of the tree, and the maximum sum is obtained by summing all the data values of the nodes traversed along this path.

[nathanqiu]

if you know how to find closest smaller node in BST, you can write it in 5 lines

[sirigiris]

Hi Sir,
will you please give numbers to all videos then it is more easy to under standard .

[samk]

Can you please add

Given a binary tree, count the number of uni-value subtrees.
A Uni-value subtree means all nodes of the subtree have the same value.

[ghoshdipan]

What happens if the key is not present?