Level of a node in a binary tree is distance from root to that node. For example
ID: 3596731 • Letter: L
Question
Level of a node in a binary tree is distance from root to that node. For example, level of root is 1 and levels of left and right children of root are 2. Example
Level Max number of nodes
1
2
4
8
16
32
.. …
n ??
The maximum number of nodes on level n of a binary tree is :
A 2^(n-1)
B 2^n
C 2^(n+1)
D 2^[(n+1)/2]
In the above answers, the operator '^' indicates power (or exponent).
Hint: Check your answer using level 5 and 6 data
2. In the blank next to each phrase below, write the term from the following list that is best described by the phrase. Two of the entries provided
Descriptive Phrase
Term
8
Top node of a tree
1
address polynomial
“Rectangular” block of data whose entries are of the same type
2
list
“Type” whose instances are objects
3
stack
FIFO storage structure
4
top
General sequential storage structure
5
queue
LIFO storage structure
6
tree
Storage structure that may contain siblings.
7
array
Used to find entries in an array
8
root
4
“Head” of the stack
9
class
Descriptive Phrase
Term
8
Top node of a tree
1
address polynomial
“Rectangular” block of data whose entries are of the same type
2
list
“Type” whose instances are objects
3
stack
FIFO storage structure
4
top
General sequential storage structure
5
queue
LIFO storage structure
6
tree
Storage structure that may contain siblings.
7
array
Used to find entries in an array
8
root
4
“Head” of the stack
9
class
Explanation / Answer
1. The maximum number of nodes on level n of a binary tree is :
option: A 2^(n-1)
At level 1 only one node, root is there
at level 2 only 2 nodex, child of root can be there.. and so on...
2.
“Rectangular” block of data whose entries are of the same type => 7 Array
Top node of a tree => 8 root
“Type” whose instances are objects => 9 class
FIFO storage structure => 5 queue
General sequential storage structure => 2 list
LIFO storage structure => 3 stack
Storage structure that may contain siblings => 6 tree
Used to find entries in an array => 1 address polynomial
“Head” of the stack => 4 top
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.