Discrete Math Quiz
1 question · no time limit
0:00
GRAPH THEORY
Question 1 of 1
No time limit
Current
Answered
Flagged
Not seen
A binary tree is constructed using the following rule: start with a root, then at each step, add two children to the leftmost node that currently has fewer than 2 children. After exactly 7 such addition steps, what is the maximum depth of any node in the resulting tree?
YOUR PROGRESS
1
QUESTION
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end