Register

GO 2017 datastructures

150 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
G Shaheena asked Aug 27, 2017
350 views
#Programming & Datastructures
Can we reverse a linked list in less than O(n) time??
Can we reverse a linked list in less than O(n) time??
User Avatar
2 votes
2 votes
1 answer
2
admin asked Apr 1, 2020
1,052 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 2
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$ $2^{h-1} – 1$ $2^{h+1} – 1$ $2^{h+1}$
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$$2^{h-1} ...
User Avatar
1 votes
1 votes
2 answers
3
admin asked Apr 1, 2020
694 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 6
Which of the following is useful in traversing a given graph by breadth first search? Stack Set List Queue
Which of the following is useful in traversing a given graph by breadth first search?StackSetListQueue
User Avatar
1 votes
1 votes
2 answers
4
admin asked Apr 1, 2020
3,715 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations? $O(n),O(n)$ $O(n),O(1)$ $O(1),O(n)$ $O(1),O(1)$
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$
User Avatar
Link Copied!