edited by
1,708 views

1 Answer

0 votes
0 votes
option B.stacks is the answer

When a function is called, activation is record is pushed onto stack.

For every 'return', activation record at top of stack is popped.

Related questions

1 votes
1 votes
2 answers
1
1 votes
1 votes
1 answer
2
go_editor asked Mar 28, 2020
902 views
Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i $0$) of the tree ? Assume that the root is at l...
1 votes
1 votes
1 answer
3
go_editor asked Mar 28, 2020
1,153 views
The height of a binary tree with $n$ nodes, in the worst case is :$O(log n)$$O(n)$$\Omega(n\log n)$$\Omega(n^2)$
2 votes
2 votes
1 answer
4