link list : Design a stack with operations on middle element in O(1)
time complexity namely push(), pop(), findMiddle(), deleteMiddle();
added an example for swap kth node problem