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.
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.
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.
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; }
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.
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.
Written this code from the video. It's ok. but giving error for the leftmost element(the first element in inorder traversal). static void getInorderPredecessor(Node root, Node search) { if (root == null) { return; } if (search.left != null) { Node temp = search.left; while (temp.right != null) { temp = temp.right; } System.out.print(temp.key + " is the predecessor"); } else { Node store = null; while (search.key != root.key) { if (search.key > root.key) { store = root; root = root.right; } else { root = root.left; } } System.out.print(store.key + " is the predecessor"); } }
![INORDER SUCCESSOR in binary search tree[CODE Explained]](http://i.ytimg.com/vi/JdmAYw5h3G8/mqdefault.jpg)
![INORDER SUCCESSOR in binary search tree[CODE Explained]](/img/tr.png)
Not all heroes wear capes some teach BSTs.
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.
rightly\said\brother.
you did a great job seriously. i was stuck for 2nd case. and i found this video today.
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.
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.
salute to teachers like you .Student need this kind of teachers
Tutorial is useful.But if you discuss about the time and space complexities,it'll be very useful. Thanks:)
it was a difficult topic to explain ..in general trees is difficult to teach ... thanks for explaining it well.
your teaching is awesomer sir....#respect
Such a Great Explanation...
Thank you Vivekanand. You helped me again!
Excellant teaching ....
You made my life easy. Thank you so much.
Hey even i do coding , but im stuck in this algo , if you're willing to help please reply back
Great Explaination !!
Your channels underrated
Very nice explanation......
You make my life so easy🙂
great explanation
Very nice explanation.. thank you.
Sir u are great👍🏾
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;
}
Ohoohoooo what an amazing tutorial....
👌👌👌video
This is just amazing! Thanks!
The only problem with the playlist is that i gave ti minimize every video to like these videos
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.
Nice explanation!
Hi Vivekanand, Can you make video on convert binary tree to binary search tree.
if you know how to find closest smaller node in BST, you can write it in 5 lines
You are awesome!!! Great Video!! Thanks!
Sir ur awsm
beautiful, thank u sir
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.
in a binary search tree there cant be more than one of the same element i think
What happens if the key is not present?
Superb!!!!!
Hi Sir,
will you please give numbers to all videos then it is more easy to under standard .
please do a video on red-black binary tree
best vedios
Thank you, sir .
Written this code from the video. It's ok. but giving error for the leftmost element(the first element in inorder traversal).
static void getInorderPredecessor(Node root, Node search) {
if (root == null) {
return;
}
if (search.left != null) {
Node temp = search.left;
while (temp.right != null) {
temp = temp.right;
}
System.out.print(temp.key + " is the predecessor");
} else {
Node store = null;
while (search.key != root.key) {
if (search.key > root.key) {
store = root;
root = root.right;
} else {
root = root.left;
}
}
System.out.print(store.key + " is the predecessor");
}
}
thankyou!😃
Thx!
YOUR FAN FAN FAN FAN !!
awesome video sir!! but shorten the content because mostly people see video to cover up quickly
awesome
thanks a lot
The second case is not true for my example tree if you can share ur mail id I can send the example
thanx
Thank
thank you for this vedio