Anyone in here good with skip lists? I have an exercise, where I need to draw, step-by-step, how insertion works. Anyone able to confirm what I've done is correct if I send it? Data structures and algorithm course **Description:** This exercise is about insertion and deletion to/from a skip list. Its a pen and paper exercise. Recall from the lecture, that the height of a list at insertion of an element is determined by the number of flips of a coin that it takes until a head is achieved. (a) Draw the development of a skip list resulting from the insertion of the elements: 20, 11, 17, 3, 45, 76, 23, 14 assuming that the corresponding sequence of coin flips is: H T T H T H T T T H T T H H T T T H T H *where H stands for heads and T stands for tails. Show the skip-list after each insertion.** **My answer:** (See image)
b) (b) Draw the development of the resulting list from (a) when deleting elements: 20, 3, 14