do ----------------------------------------(A) { -------------------------------------------(B) for (j = 2; j <= k; j++) ------------(C) p = p + 1; ----------------(D) m = m+1; ------------------------(E) j++; -------------------------------(F) } while (j < k); ---------------------------(G) What is the value of line (D)? (Numeric Answer ONLY) 2 . Postorder: 7 6 8 5 2 9 4 10 3 1 Inorder: 6 7 2 5 8 1 4 9 3 10 After drawing the tree, how many is/are the nonleaf node(s)? (Numeric Answer ONLY) 3. b = 0; while (b < 100) ---------------(A) b += 1; ------------------(B) What is the value of line (A)? (Numeric Answer ONLY)
do ----------------------------------------(A)
{ -------------------------------------------(B)
for (j = 2; j <= k; j++) ------------(C)
p = p + 1; ----------------(D)
m = m+1; ------------------------(E)
j++; -------------------------------(F)
} while (j < k); ---------------------------(G)
What is the value of line (D)?
(Numeric Answer ONLY)
2 .
Postorder: 7 6 8 5 2 9 4 10 3 1
Inorder: 6 7 2 5 8 1 4 9 3 10
After drawing the tree, how many is/are the nonleaf node(s)?
(Numeric Answer ONLY)
3.
b = 0;
while (b < 100) ---------------(A)
b += 1; ------------------(B)
What is the value of line (A)?
(Numeric Answer ONLY)
4.
Convert to Infix Notation
*/-MN+OP+QR
5.
do ----------------------------------------(A)
{ -------------------------------------------(B)
for (j = 2; j <= k; j++) ------------(C)
p = p + 1; ----------------(D)
m = m+1; ------------------------(E)
j++; -------------------------------(F)
} while (j < k); ---------------------------(G)
What is the value of line (E)?
(Numeric Answer ONLY)
6.
do ----------------------------------------(A)
{ -------------------------------------------(B)
for (j = 2; j <= k; j++) ------------(C)
p = p + 1; ----------------(D)
m = m+1; ------------------------(E)
j++; -------------------------------(F)
} while (j < k); ---------------------------(G)
What is the value of line (B)?
(Numeric Answer ONLY)
7.
do ----------------------------------------(A)
{ -------------------------------------------(B)
for (j = 2; j <= k; j++) ------------(C)
p = p + 1; ----------------(D)
m = m+1; ------------------------(E)
j++; -------------------------------(F)
} while (j < k); ---------------------------(G)
What is the value of line (A)?
(Numeric Answer ONLY)
8.
Postorder: 7 6 8 5 2 9 4 10 3 1
Inorder: 6 7 2 5 8 1 4 9 3 10
After drawing the tree, how many ancestor(s) does node 7 has/have?
(Numeric Answer ONLY)
9 .
Postorder: 7 6 8 5 2 9 4 10 3 1
Inorder: 6 7 2 5 8 1 4 9 3 10
After drawing the tree, what is the sibling of 7?
(Numeric Answer ONLY)
Step by step
Solved in 3 steps
