we are going to talk about binary tree, its properties and its types. Right. In the previous
video, we have discussed what is a tree and you can see that introductory part of trees.. EAch
node. Each node is having what information plus may or may contain links. That is not
compulsory that each node should contain link to another node. Maybe if node does not have
any child, then it will not contain any link.. We will discuss the implementation of binary tree
right now next thing is see now some properties of the binary tree. See we have discussed
what is our level in the previous video. This is not. This is what level zero is. AT level 0. The
maximum node possible is only 1 right at level two. The maximum number of children
possible are maximum means each of this node is having maximum children. The. Maximum
number of nodes possible in a binary tree is 2 raise to power I. Maximum number of node
possible at any level I is 2 raised to the power. AT level four sixteen maximum nodes can be
possible at level four at height four at level three at height H. Minimum number can be H
plus 1 minus 1 if height is h..
IF suppose you are given maximum node minimum nodes and you are supposed to calculate
the height. You can see the maximum height of the tree possible. Minimum. Number of
nodes possible are H plus one. Minimum height possible means minimum number of node
possible. IF height is one means this one one height one two and three height is three. A full
or strict or proper binding tree is also known as proper or strict binding tree. The definition is
what it is a binary tree where each node contains either zero or two children.. THe property of
this full binary tree is what here number of leaf nodes is equal to number of internal nodes
plus one. Number of leaf node count one two, three, four five and six. This tree see maximum
node is same as binary tree right because at this level there can be two. raised to power I
maximum nodes and if height is at H, then you need to add all the maximum number of
nodes at each level.. THis tree is not a full binding tree. We need a full binary tree, so here
you need one more node..
Complete mind tree see we have told you except the possibly the last level. All the levels are
completely filled. See. each node is having two child so one condition is true. Now. Second
condition is complete binary is what in the last. level, the nodes should be as left as possible
means we are going to fill the nodes in the. last level from left to right.. You can not leave
these nodes free these spaces free and you can not write here. Then child node right so you
need to delete and if i shift here. Then this is what a complete binary tree. A tree can be a
perfect binary tree. If all the internal nodes are having two children and all the levels sorry.
All the leaves. All the leaf nodes are at same level. The minimum height in the complete
minded tree is log n.. A perfect binder tree is also a full-minded tree, but vice versa is not
true. A left or right skewed. It is a mixture of both fine, so I guess this is all about binary tree
plus properties of binary tree.
video, we have discussed what is a tree and you can see that introductory part of trees.. EAch
node. Each node is having what information plus may or may contain links. That is not
compulsory that each node should contain link to another node. Maybe if node does not have
any child, then it will not contain any link.. We will discuss the implementation of binary tree
right now next thing is see now some properties of the binary tree. See we have discussed
what is our level in the previous video. This is not. This is what level zero is. AT level 0. The
maximum node possible is only 1 right at level two. The maximum number of children
possible are maximum means each of this node is having maximum children. The. Maximum
number of nodes possible in a binary tree is 2 raise to power I. Maximum number of node
possible at any level I is 2 raised to the power. AT level four sixteen maximum nodes can be
possible at level four at height four at level three at height H. Minimum number can be H
plus 1 minus 1 if height is h..
IF suppose you are given maximum node minimum nodes and you are supposed to calculate
the height. You can see the maximum height of the tree possible. Minimum. Number of
nodes possible are H plus one. Minimum height possible means minimum number of node
possible. IF height is one means this one one height one two and three height is three. A full
or strict or proper binding tree is also known as proper or strict binding tree. The definition is
what it is a binary tree where each node contains either zero or two children.. THe property of
this full binary tree is what here number of leaf nodes is equal to number of internal nodes
plus one. Number of leaf node count one two, three, four five and six. This tree see maximum
node is same as binary tree right because at this level there can be two. raised to power I
maximum nodes and if height is at H, then you need to add all the maximum number of
nodes at each level.. THis tree is not a full binding tree. We need a full binary tree, so here
you need one more node..
Complete mind tree see we have told you except the possibly the last level. All the levels are
completely filled. See. each node is having two child so one condition is true. Now. Second
condition is complete binary is what in the last. level, the nodes should be as left as possible
means we are going to fill the nodes in the. last level from left to right.. You can not leave
these nodes free these spaces free and you can not write here. Then child node right so you
need to delete and if i shift here. Then this is what a complete binary tree. A tree can be a
perfect binary tree. If all the internal nodes are having two children and all the levels sorry.
All the leaves. All the leaf nodes are at same level. The minimum height in the complete
minded tree is log n.. A perfect binder tree is also a full-minded tree, but vice versa is not
true. A left or right skewed. It is a mixture of both fine, so I guess this is all about binary tree
plus properties of binary tree.
