My Courcs
inn-u-in Conloct uEnglihn
era CS 3303-01 Data Structures -AY2022-T5 O-UEE53/sanco/pue 202TS/7y1dySlfi ni4
Started on Wedneday.13 Juy 2022,10:20 AM
Completed on Wednesday.13 Juy 2022.10:20 AM Time taken 10 secs (0100p
Aleaf is any node tht
Mared OUt f 1.00 Flag queslon
Select one: aHas onechid bis an intermne with o ancestor is any node with tvo empty chiidren d.is the ancestor of the roct node
The correct answer isIs any nodle with two empty children
Thefull binary tree theorem statehe number ofeaves in an empty full inarytree isone more than the number of inenal nodes
Select one: True Ofalse
The correct aner is False
The process for visiting all of the nodes of a binary tree in some order is called a traversal.
Maed out cf 1.00
Select one: True false
The correct answer isTrue
A full binary tree has a restricted shape whi ich starts at the root and flls the tree by levels from left to right.
Vot answere
P.ug queston
Select one: True false
The correct answer is False.
0Jn.5
A binary tree traversal that lists cvery node in the tree exactly once is callec
Mered out ef 1.0 F Rg questen
Select one: a.aTraversal b.A visiter design pattem n enumeratio Natural ordeing sequence
The correct answer is:An enumeration
n6
Miroed outef 1.0 Plag qouorfon
Select one: True False
wer is False'.
Correctly identiy thefollowing heap structure by selecting the best answe
Mend out ef 1.
100 1 36
0
Select one
b.max-heap stnucture priority heap min-heap stracture
Select the answer that best defines Hufman Coding:
Not anower Marend gut ef1.
Select one
re efficient priority queu
pon the relative frequency of the corresponding character in use
Not answere Md ut cf 10
A
?
c
290
10
According to textbook by Shaff a heap data structure has two properti which are
MeBred out efi.00 ag qus
Select one
it is amin-hea t is a complete binary tree and the values stored in it are partially ordlered dit is priority queue and is in G(n)
Thcort anwer i i acompleinary r nd th valusordin re partilly orded
Finish re