In binary tree there are
n ancestor at level n.
Proof :
Take P(0): At node level
0, it has no ancestors since this is a roo tnode.
Take P(1): At node level
1, it has one ancestor. The ancestor is the root, its parents which is at level
0.
Take P(K): A node level
K it has K ancestors. Its parent is at level K – 1.
Take P(K+1): At node K +
1 level have more than one ancestor than that of node at k level.
<span>Thus there are n ancestor
at level n in binary tree.</span>
Answer:
-37
Step-by-step explanation:
Well for the multiplication its easy because if it is different signs then all you have to do is multiply it normally the add the negatuve sign.
6×5=30
-6×5=-30
2. For adding negative number to a negative number you just add it on.
Reflecting over y=x maps (x,y) onto (y,x).
So, the answer is A. (-8, 3).
Answer:
The acceleration in the system and in the rope is same as 5.88 m/s2.
Step-by-step explanation:
The figure shows two blocks of m1 = 0.8 Kg and m2 = 0.2 kg if the block of mass m2 is dragged by the block of mass m1 calculate the acceleration of the system and the acceleration of the rope
Let the acceleration is a and the tension in the string is T.
Use Newton's second law
Answer:
Step-by-step explanation:
Freezing is 32 degrees F.
32-9= 23 degrees F.