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:
x= 6
Step-by-step explanation:
Step-by-step explanation:
step 1. tan x = opposite/adjacent = c/b
step 2. cos x = adjacent/hypotenuse = b/a
step 3. sin x = opposite/hypotenuse = c/a
Answer: A. (5; 0), B. (0; - 5), C. (-5; 0), D. (0; 5).
Step-by-step explanation:
A. (5; _) <em>[x = 5; y - ?]</em>
x² + y² = 25
5² + y² = 25
25 + y² = 25
25 + y² - 25 = 25 - 25
y² = 0
y = 0
A. (5; 0)
B. (_; -5) <em>[x - ?; y = -5]</em>
x² + y² = 25
x² + (- 5)² = 25
x² + 25 = 25
x² + 25 = 25
x² + 25 - 25 = 25 - 25
x² = 0
x = 0
B. (0; - 5)
C. (_; 0) <em>[x - ?; y = 0]</em>
x² + y² = 25
x² + 0² = 25
x² + 0 = 25
x² = 25
x = ± √25 = ± 5
C. (-5; 0) or (5; 0)
<em>Point A has coordinates (5; 0), which means that</em>
<em>point C has coordinates (-5; 0).</em>
D. (0; _) <em>[x = 0; y - ?]</em>
x² + y² = 25
0² + y² = 25
0 + y² = 25
y² = 25
y = ± √25 = ± 5
D. (0; - 5) or (0; 5)
<em>Point B has coordinates (0; -5), which means that</em>
<em>point D has coordinates (0; 5).</em>
Answer:
B
Step-by-step explanation:
To select the correct equation, check to see that the c term of is 2 since the y-intercept is (0,2). This means only A and B are options since C and D have -2.
For A and B, substitute the other two points (-2,8) and (1,5) into the equations and see if it hods true.
This is not 8 and is not true.
This is true. This is the solution.