No student devices needed. Know more
12 questions
What would be the answer to this expression tree?
28
27
31
29
What are the nodes at depth 2?
[B,C]
[D,E,F,G]
[H,I,J,K,L,M,N,O,P]
[A]
How could I get to the node with the K value?
root.left.right.left
root.right.left
root.left.right.right
root.left.left.right
What are the leaves of this tree
[4,3,2,1]
[2,3]
[1,2,3]
[4,5,6,7]
Is this Tree a Binary Tree?
Yes
NO
How many levels would a tree have to have be to contain 32 nodes(with the first level being considered as 0)
0
1
4
3
What is the root of this Binary Tree?
7
14
8
1
What is the parent of the node with the value of 6
11
7
2
5
What is the equation of this Expression Tree?
((2+3)*9)+7
((2+3*9)+7
(2+3*9+7)
(2*9)+(3+7)
What is the node above the node with the value E called?
leaf
child
root
parent
How would I get to the node that has the value 13?
root.left.right.right
root.right.left.right
root.right.right.left
root.right.right.right
What is the most amount of children a parent could have in a Binary Tree
0
1
3
2
Explore all questions with a free account