Data structures: Binary Tree
Вставка
- Опубліковано 16 січ 2014
- See complete series on data structures here:
• Data structures
In this lesson, we have discussed binary tree in detail. We have talked about different types of binary tree like "complete binary tree", "perfect binary tree" and "balanced binary tree" and their properties. We have also discussed how cost of operations in a tree may depend upon height of the tree and why we want a tree to be dense and its height to be minimum. Finally, we talked about two possible implementations of binary tree - a) using dynamically created nodes and b) using arrays.
For practice problems and more, visit: www.mycodeschool.com
Like us on Facebook: / mycodeschool
Follow us on twitter: / mycodeschool
Felt very sad that the guy who was founder of these courses passed away on June 2014 . in a car accident! but he is alive with his videos!!! RIP !! :(
Yes, they're fantastically dense full of info and comprehensive.
how do you know this? who is running the channel now, cuz the last video on this channel is 4 years old.... please reply I really wanna know the answers.....
he always live in our heart, never be forgot. Every moment we get inspired in some moment in the future
@@qq3801 thanks buddy for this
sad to hear that. RIP
If anyone is having confusion between depth and height, think of the analogy that we measure the 'depth' of sea from it's surface and the 'height' of a person from toe to head.
PS: This was taken from a stackoverflow thread.
I'm still confused about height and depth of a tree!
what do you mean!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1
stole this right off of Stackoverflow. Credit the person smh.
Let's imagine an example of a fish swimming in the sea. Here, fish resembles a node, and the height of the fish from the sea bed resembles the height of the node and the depth of the fish from the surface of the sea resembles the depth of the node.
Have a look at the diagram below:
_ _ _ _ _ _ _ _ _ _ _ _ _ == surface (root node)
|
| == Depth from the surface of the sea (if there are d no. of edges to get to node x)
|
((*)) === Fish Any particular node (x)
|
| == Height from the bottom of the sea (if there are h no. of edges from the bottom-most leaf)
|
_ _ _ _ _ _ _ _ _ _ _ _ _ == sea bed (leaves, end of tree)
Eshaan thanks for sharing
I cannot thank you enough for this playlist on Data Structures! Keep up the good work :)
I click on every ads that you show because you are teaching me well and it is my duty to give some money from ads to you. Thanks mycodeschool.
He passed away..
@@blackflame_ his friend passed away...
@@lyfokzz3848 Whoever he was I owe him for helping me clear my courses
@@blackflame_ yup...some of the real IT/CS people will understand his work!
It's the cofounder Animesh Nayan. And I think he doesn't need anyone's money. And death happened to Late Harsha who was also a managing member of MyCodeSchool. Read this: blog.mycodeschool.com/2013/12/the-story-of-mycodeschool.html?view=classic
Thanks for your hardwork...you did awesome job that benefit many students like me...Thumbs up and keep on sharing.
Jamyang Tashi Thans a lot :)
J
🙌🏻
@@mycodeschool Helped me in 2020
@@Dhruv-jf1ho yeah, always has been 🙌
Best data structures tutorial around the web. Thanks for enlightening!
You are an amazing teacher thank you so much for helping me understand these topics more completely.
This is a masterpiece, thank you so much for the job that you're doing!
Here is the next video - Data structures: Binary Search Tree
+mycodeschool at 13:20 you show the height of the left child of root is 2. The height of left child of 2 is 0 here not 1. so how the height is 2?
+NISHANT NIKET You are right. The height of the left child of 2 is 1 and not 0. But we are talking about the abs difference between the height of left and right sub tree. So, lheight = 1, Rheight = 1, lheight - Rheight = 0.
Hope this helps!!
I have been watching this video since 2015 and I never get tired even on this 2019. Thank you so much for this wonderful work.
@@cafafans me too
mycodeschool ahhhhh.. I see!! *pointer to “the next video”...... GENIUS teachings
This is an awesome series - even 7 years later!
Hands down best videos on the net for Data Structure. Awesome work man.
oh my god this was so helpful. i've read so much content about trees and watched so many videos that always left me even more confused. But THIS ... this was just perfect and extremely well explained. thank you so much for making this video.
thank you mycodeschool
for good and free video tutorial.
it is a complete data structure. help me understand outside my class.
u teach very well...finding it easy cuz of u..:)
Lots and lots of information in just one video. Thank you so much for your effort and dedication towards sharing this valuable piece of information. Keep up the great work.
hats off to u sir ! ur videos r life savers ! helped me alot during my dsa viva !!
u r truly great teacher ! :))
Sir you are the best teacher I have seen on UA-cam you teach in such a simple way 🙏
Best teacher of data Structure I have ever seeen .. Salute your efforts and hardwork ...
The best explanation i've ever seen. Thank you!
Thank you so much for wonderful video with the subtitles. Finally,now i can understand what a binary tree is.
All your data structures videos are great ! Thank you so much!
excellent sir....& lots of thanks to help me as such easy language to learn tree...I appreciate u sir
Awesome videos, keep up with adding the captions please!!! Makes it so easy to follow along, great tutorial!
mycodeschool is doing an awesome work.... Keep going ..
Thank you for your videos! I learn a lot from them and I will continue watching.
Thanks a lot for this data structure playlist! A life saver if u ask me..
I know I know i'm pretty late.. but still thanks again!
thank you so much for the videos. I have never thought that I would learn DataStructures with so ease. Really loved each and every video(content, concepts and the way of teaching). Eagerly waiting for other Concepts of DataStructure and Specially Trees and Graphs. Hope you would continue with many more.
rey bujji chadavalekapothunnam ra
Best lecture on a binary tree so far.
fantastic work .... very easy n smooth take over
Awesome Channel! This is the best explaination i came across atleast for linked lists!
This was a mind-blowingly good video! Glad I decided to redo my math as I started watching the first videos of this playlist. Knew it would come in handy. I'm very thankful these videos were made, and wish their creator was still alive to see how many people they help.
Can you pls tell me what math do I need to learn to be able to understand this? Your answer would really help me
@@paula19335 Just regular high school math. Exponents, square roots, logarithms. It's nit so much about a very specific part of it as it is about observing and applying mathematical thinking.
thanks to making such a nice tutorial it will covers all necessary information to starting binary tree.
thanks again.
realy helpin in improvin concepts.....voice is clear ...
thanks for the videos...learnin DS with ease.
Great tutorials. Thank you.
Instead of thanking him on comment section. You could white list his channel on Ad-block ( if you are using one).
Excellent! Explained very well. Thanks for these videos
Excellent even after 5 years..Thank you
Just too Good.. Awesome concepts .
Channel will be popular soon !!
Do you have any tutorials on threaded binary trees? Is there any possibility you could make one? I have trouble understanding it in class and your tutorials have been very useful to me so it would be great if you could make one. Thanks!
Your explanation is clear and adequate , is it possible to discuss the implementation in java ? especially implementing the linked list class. Thanks !
Thank you for your good explanation.
tree can be implemented using arrays if tree is perfect binary tree not just complete .
and your are one of the best in cs topics on the entire internet ,keep uppp
Your tutorials are just awesome man.
Thanks a lot sir yoh have good job and great effect in this way to help students whose want to increase the knoweldge wd conpect.
Your videos are amazing!
You saved my life :) I love you :)
Guys there also exists a different version
ACBT = Complete Binary Tree of mycodeschool
Complete BT = Perfect Binary Tree of mycodeschool
While Full/Strict/Proper and Perfect BT all are same.
Hi. I am one of your subscriber, been following you for a couple of months. Can i possibly use this as a reference in our class, seems like you do have a very clear way of explaining. Thankyouuu.
the series in the description is very helpful . thanks
awesome way of teaching
this is awesome !!! youre a very good teacher :) thanks
These videos are fantastic, thanks a bunch!
why dont u go to ur country and study
o.Ô
Haha. What's wrong with you man? Its UA-cam. Its free and available to all.
Its 2021 but still the best playlist on Tree DS on youtube
i love ur tutorial and i think they are best
amazing job, this is really helpful, thank you ☺😊
Very nicely done, thanks for sharing this one for us :)
Good Work !! Thank You !
Brilliant explanation of the Binary Tree
Excellent explanation!!!
Incredibly helpful, thank you.
Excellent tutorial!
Great lesson. Very good!
that advertisement for charity : water was the best ad i've ever seen. it feel like a changed person and im not even kidding.
Your videos are excellent...thanks a lot.
thanks for teaching in a simple language...
bro your explanation is amazing
at 13:04 I am confused how you say the height of left subtree is 1? I thought it was 2. Say node x is the one in red. I watched the previous vid and it says, the height of x is the number of edges in the longest path of x to a leaf. I counted 2?
I look at it this way to make it easier.
if left subtree has no edge - height = 0
if right subtreee has no edge - height = 0
if left or right subtree has an edge, add up all the edges leading to the deepest leaf node then use your formula diff = | leftsubtree_height - rightsubtree_height |
Matt Stewart - We are saying height of left and right subtrees. Height is defined as number of edges in some longest path from root to a leaf. For the sub-trees, the root node is not the node marked in red. For left subtree, root node is the left child and for right sub-tree root node is the right child. We need to calculate from root of the respective subtrees. Let me know if this is still not clear to you.
Actually, you can calculate the diff, by saying 0 height if there is no child. Actual diff wont change. Lot of people do that. That's ok.. But when we say subtree, we cannot count the node (marked in red here) itself.
mycodeschool thanks so much, that makes sense, I didn't understand where the subtree started.Learning alot from your clear vids.
Matt Stewart
Thanks for the question :)
Still not clear. Height of left subtree is 2 and not 1 since there are 2 edges from root of left sub-tree to the leaf while chosing longest path. Please clarify
Height of the left subtree means counting no. of edges starting from the left node and not from the base root itself, maximum no. of edges from left node to the leaf node is 1 hence, height of left subtree is 1.
Consider it as a new temporary tree of which base root is the left node and just calculate height of it.
Would you do AVL, RBT, and 2-3 tree? Your tutorials are awesome!
This is very clear, thank you.
went through all videos of this play list and hats off guyz .. awesome work..
eagerly waiting for more videos ..
Thanks Nitin Kapoor , We will be adding at least 2 videos in this series every week.
Nitin, Here is the next video Data structures: Binary Search Tree
thanks mycodeschool . awesome one again .
@@mycodeschool its been 8 years sir, please complete the play list :(((
You are such an amazing person
thanks a lot :)
amazing content, really loved it :)
I want to provide a suggestion that when you write at down of the board it gets hidden by the words displaying above it.
Mind it please, it will further enhance your work and thanx for providing the best.😊
for node2 at 12:51 , you mentioned diff = |1-(-1) |
But Shouldn't it be |2-0| ? Left subtree has height 2 and right as 0... 0 because we still have node 2 and it's not empty node. The difference is 2 anyway.
Exactly my doubt!!! Thank you for confirming !!!
Wonderful content, thank you very much.
Great work by u people....!!!!
Thank you very much.
Great lesson. The log stuff threw me off, but I just need to review all that anyway
@mycodeschool Awesome work
This is a great video. Just had one doubt, i understood we consider height of node as 0 if there are no child nodes and height of tree as -1 if there is no root. However, around 13th minute we considered tree with no child nodes with height -1(instead of 0), also made height of left sub-tree as 1(instead of 2).
yeah, I got confused there too. at 13:11 it should be |2-0| = 2 not |1-(-1)| = 2 by his definition. Am I right?
Thank you for this video coz I learn more:)
thanks for the quality videos.
please teach redblack tree and splay trees.
perfect . Thank you very much.
Based on this it would be safe to assume that using timestamp based primary keys is not a good idea in mysql? It uses b-trees for storing indexes. With id based indices you are essentially constantly building a linked list that mysql has to rebalance in the background. On a very hot table this would result in a lot of extra work necessary to keep read speed reasonable.
@mycodeschool
A Small Correction:-
Maximum no of nodes in a complete binary tree with height h is 2^(no. of levels+1) - 1.
In the video it is written as 2^(no of levels) - 1.
+saiavinash duddupudi i think you are mistaken. No. of levels is equal to height + 1.
Ur videos r awesome.......... But one simple request........can u plz put that subtitles little down coz we can't see what is written on bottom of the board
Thank you very much for your work. This channel is a fucking gold mine!!!
@13:08 How is the height of left sub tree -1? I think it should be 2, right?
your are very clever and accurate person
Even if the tree is not complete you are still able to use an array. You can use -1 or any invalid number for the children that are missing!
Ali Jafari That's true !!
Very clear and concise explanation.
I just wrote this yesterday. weird
public class tree {
private node root;
public tree(){
setRoot(null);
}
public node getRoot() {
return root;
}
public void setRoot(node root) {
this.root = root;
}
public void inOrderTraverse(node x){
//System.out.println("boo");
//System.out.println("root value" +x.getValue());
if(x == null){
return;
}
inOrderTraverse(x.getLeftChild());
//System.out.println("hi");
System.out.println(x.getValue());
inOrderTraverse(x.getRtChild());
}
public void addToTree(int x){
node n = new node(x);
if(root == null) root = n;
else add(root, n);
}
public void add(node p, node target){
//System.out.println("hi");
if(target.getValue()< p.getValue()){
if(p.getLeftChild() == null)
p.setLeftChild(target);
else
add(p.getLeftChild(), target);
}
else{
if(p.getRtChild() == null)
p.setRtChild(target);
else
add(p.getRtChild(), target);
}
}
}
I was having trouble understanding graphs, and found it was because I didn't understand trees well enough. That's some nice code there. Capitalize your classes, ya dingus!
Are you doing Direct Marketing Strategy diagrams again Jeff?
No, but it sure does look similar. This is a portion of a Computer Science class I had last semester and I was brushing up.
The mystery of the unknown intrigues you doesn't it? Me too!
very helpful, thanks...
i have a doubt..@13:06 why is the height of the left subtree 1 and not 2? i mean given that height of a node is the maximum path up from a leaf,shouldnt it be 2?
Note the word "subtree". Subtree is the blob after edge from the red node. The blob has 3 nodes total; height of the blob is 1. Thus, height of left subtree is 1.
theFifthMountain123 Thanks man!
Abhinav Mishra I'm a woman. Not your fault though, typical programmer is a nerdy guy which I'm not.
@@theFifthMountain123 if this is the case that you mentioned above then how did you find difference one at 12:49.AS your both lest and right sub-tree height is one.
How did you get 1 left child in 13:04 seconds? There are two edges from the left subtree to the leaf.
left subtree is the node left to the node marked in red which has height of 1 where as right subtree is the tree on the right of red marked node which has height of -1 coz it is empty
The height is the maximum depth of a leaf node in the graph! Height and depth can be the same when a node has as many ancestors as descendants :)
Thnqq u sir ,this video is very usefullll,,thnqqqq uuuu soooooo muchhhhhhhhhhh☺☺
nice! really helped!
Great tut
Great stuff