DS retest question

1. Explain in detail about cursor implementation (10mark)
2. Application of list (8 marks)
3. stack linklist implementation(8mark)
4. Avl singly and doubly rotation insetion routine(12mark)
5. binary heaps(8ma)
6. binary search tree insertion forr foll 6,2,8,1,4,3,5