Data Structure Questions Answer Objective Type
Click on question to see right ans.
Counting the maximum memory needed by the algorithm
Q2
Traversal
Q3
Threaded trees
Q4
Terminal nodes
Q5
Dn = log2(n+1)
Q6
Predecessor
Q7
Digraph
Q8
Threaded Trees.
Q9
Free graph
Q10
Copies
Click here for next
0 Comments:
Post a Comment