211 views

Please log in or register to answer this question.

Related questions

1.1k
views
1 answers
0 votes
gagan55 asked Jul 13, 2023
1,107 views
How to Visualize this code ?#include<stdio.h> #include<stdlib.h> struct node{ int data; struct node *next; }; void addFirst(struct node **head,int val){ ... addFirst(&head,30); addFirst(&head,40); addFirst(&head,50); printList(head); }
469
views
1 answers
0 votes
kickassakash asked Jul 4, 2023
469 views
I have specific doubt on this question and I’ve tried to explain that in the picture ,If anyone can explain it then it’ll be of great help. according to sachin sir the answer should be false( fyi).
464
views
1 answers
0 votes
Souvik33 asked Apr 2, 2023
464 views
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible?$n^{2}$nlogn n logn
922
views
1 answers
0 votes
Souvik33 asked Nov 2, 2022
922 views
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 link list with only head pointerBinary treeArray