2 In the circular double linked list, the operations are as follows to insert th

Question

2 In the circular double linked list, the operations are as follows to insert the node pointed by S before P: S->next P: S>prior : P>prior->next - S: Pprior S 3 Please write down the output results the following function. void main0 Queue Q: Init Queue(Q); Enter Queue( Q. 'h'); Enter Queue(Q,'r Enter Queuel Qy): Delete Queue( Q,x): Enter Queue( Q. x ) Delete Queue( Q. x ): Enter Queue( Q. 'a'): while( QueueEmpty(Q)) (Delete Queuet Q,yprintfe",y) ) 1- printf(-%c", x ); 4 The time complexity is for the following programs. ( 3 points) K-1; While (ken) k=k*2; In the following array a, there is a linked linear list. The list head pointer is .net, then the data elements in the list should be (6 points) a0 data next 74 25 74 60 56 42 | 38

Explanation / Answer

2) Answer: s -> prior = p->prior (Making S-> prior to point p-> prior that means the element which is prior to p.)

3) Answer: You will get following output. first "c" gets printed and then "h" and then "a" and finally "r"

Output: char

4) Answer: Starting at 1 the k values gets doubled in the loop till k reaches n value that is k<=n

so O(log2n) complexity applies to the given program

5) Answer: In the given Linear linked list, the data elements are a[0].data, a[1].data, a[2].data and so on.

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.