I am confused, starting at timestamp 1:51 you say the leftmost node will be smaller and the rightmost node will be bigger, but that is only for binary search trees, correct? The leetcode problem #94 problem is for binary trees, not just binary search trees.
Free content and unfortunately mistakes happen. For that reason I never trust medical advice from utube. Thankfully we have smart commenting. BST is a type of binary tree and not all binary trees are BST,
At 1:38, what you are talking about (left node value < root node value < right node value), that is for Binary Search Tree, not binary tree in general.
Is the time complexity O(nlog(n))? That would intuitively make sense to me. I couldn't find the part in the video where the time complexity was explained...
I'm confused.. are these properties: .left .right and .val inherent in a binary tree / the root argument? They aren't declared in your code so are these properties common naming conventions in trees or something? I just don't understand where they're coming from?
This video cleared all my confusion on Morris Traversal. Perfect explanation. Thankyou
3:40 is where the Morris algo started.
Thank you! This is the clearest explanation of Morris Traversal I've seen so far! Can't wait to see more of your videos!
I am confused, starting at timestamp 1:51 you say the leftmost node will be smaller and the rightmost node will be bigger, but that is only for binary search trees, correct? The leetcode problem #94 problem is for binary trees, not just binary search trees.
have to say, no offense to other popular videos, but this one is way much better 👍
Nice solution, easy to memorise.
Incredible explanation, so great how you used an analogy!
Binary Tree and Binary Search Tree are different.
Free content and unfortunately mistakes happen. For that reason I never trust medical advice from utube. Thankfully we have smart commenting. BST is a type of binary tree and not all binary trees are BST,
This is the best explanation I've ever seen! Awesome job.
I like before watching your video because i know it's gonna be great. thank you
Nice! Your videos are really helpful. All explanations are good and clear. Thank you!
At 1:38, what you are talking about (left node value < root node value < right node value), that is for Binary Search Tree, not binary tree in general.
honestly! the explanation is really great!!!
very nice presentation! thank you!
awesome💯✨
Excellent Video, thank you!
Is the time complexity O(nlog(n))? That would intuitively make sense to me. I couldn't find the part in the video where the time complexity was explained...
You should sample the diagram on the right side while doing coding, so one can visualize very easily!!! BTW Great Explanation
I'm confused.. are these properties: .left .right and .val inherent in a binary tree / the root argument? They aren't declared in your code so are these properties common naming conventions in trees or something? I just don't understand where they're coming from?
There is enough space in your window to increase the font size.
why you are peeking at your right side, is there solution?
Nice approach, but zoom the code while writing
Very good explained but BACKGROUND MUSIC IS VERY IRRITATING 😞
Very good
why I don't see bridges?
I noticed the lines I drew are super small. In the future vids I’ll make it more obvious. If you full screen the video you should be able to see it
Ты шо, препод ?)