Register

DATA STRUCTURES

621 views
0 votes
0 votes

WHY?? CAN ANYONE EXPLAIN

User Avatar

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

0 votes
0 votes
1 answer
1
Souvik33 asked Nov 2, 2022
864 views
Ace Test Series Data Structure Q9
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristics Singly link list with head and tail pointer Doubly link list with only head pointer Binary tree Array
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristicsSingly link list with head and tail pointerDoubly l...
User Avatar
1 votes
1 votes
1 answer
2
jugnu1337 asked Jul 17, 2022
536 views
data structure
Consider a standard Circular Queue ‘q’ implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[1], q[2], ……, q[10]. The front and rear pointer are initialized to point at q[2]. In which position will the ninth element be added?
Consider a standard Circular Queue ‘q’ implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are...
User Avatar
0 votes
0 votes
1 answer
3
amitarp818 asked Nov 28, 2023
608 views
Made easy Data structures
Consider the following array of elements <96,42,50,17,15,5,7,11,39,23,6,9,19,100,12> The minimum number of interchanges using buildheap needed to convert it into a max heap is
Consider the following array of elements<96,42,50,17,15,5,7,11,39,23,6,9,19,100,12>The minimum number of interchanges using buildheap needed to convert it into a max heap...
User Avatar
Link Copied!