This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: b) Using the routine in Section 2.4.4 (p.32)? Q8. Swap two adjacent elements by adjusting only the pointers (and not the data) using: a) Single linked lists. b) Doubly linked lists. ∑ = = N i i i X A x F ) ( 4 Q9. Given two sorted lists, L1 and L2, write a procedure to compute L1 ∩ L2 using only the basic list operations. Q10. Show how to implement two stacks using only one array. Your stack routines should not declare an overflow unless every slot in the array is used. Q11. Show how to implement three stacks in one array....
View
Full
Document
This note was uploaded on 12/28/2010 for the course CSC CSC1110 taught by Professor Cjyuan during the Fall '06 term at CUHK.
 Fall '06
 CJYuan

Click to edit the document details