What is the time complexity of binary search in a sorted array?, A. O(n), B. O(log n), C. O(n²), D. O(1), Which data structure is best for implementing recursion?, A. Queue, B. Tree, C. Stack, D. Graph, Which of the following is a non-linear data structure?, A. Array, B. Linked List, C. Stack, D. Tree, In a singly linked list, each node contains:, A. Data only, B. Data and previous pointer, C. Data and next pointer, D. Previous pointer only, Which traversal technique uses a queue internally?, A. Depth First Search, B. Breadth First Search, C. Inorder Traversal, D. Postorder Traversal.
0%
Untitled2
Share
Share
Share
by
Saranyaai
Edit Content
Print
Embed
More
Assignments
Leaderboard
Show more
Show less
This leaderboard is currently private. Click
Share
to make it public.
This leaderboard has been disabled by the resource owner.
This leaderboard is disabled as your options are different to the resource owner.
Revert Options
Spin the wheel
is an open-ended template. It does not generate scores for a leaderboard.
Log in required
Visual style
Fonts
Subscription required
Options
Switch template
Show all
More formats will appear as you play the activity.
)
Open results
Copy link
QR code
Delete
Continue editing:
?
