Other
Exam
Programming
Queues serve a major role in
Option 1 : simulation of recursion
Option 2 : simulation of arbitrary linked list
Option 3 : simulation of limited resource allocation
Option 4 : expression evaluation
Read Solution (Total 1)
-
- It is 12. The tree may be of depth 2 or 1. if the depth is 2, we have 6 possible trees. This is because one of the three nodes A, B, C may be the root and the next level may be one of the remaining two nodes. If the depth is 1, the root may be one of the 3 nodes A, B, C. Corresponding to a root, say A, two trees as possible as this.
- 8 years agoHelpfull: Yes(0) No(2)
Other Other Question