data structure and algorithms

chapter - arrays and recursion

2. Write a pseudocode to perform deletion off of the i'th position on a doubly-linked list. (You may assume pointers such as tmp, cur, head, tail and pointers within a node such as tmp-prev and tmp next as necessary. Also, use NULL to indicate a null pointer.) 3. Write a pseudocode to perform deletion of a node at the head on a circular doubly-linked list. In the circular doubly-linked list, the next pointer of the last node points back to the 1st node instead of NULL. Assume a pointer is ponting at the tail node on the list. (You may assume pointers such as tmp, cur, head, tail and pointers within a node such as tmp.prev and tmp.next as necessary.)