Problems1. [1 Mark] Consider the data sequence S = [82, 91, 13, 92, 64, 10, 28, 55, 96, 97]. Draw a valid AVL tree for it, assuming that the data has arrived one at the time. Show detailed steps by giving the AVL tree after inserting each element.2. Consider two sets of

| February 14, 2018

Problems1. [1 Mark] Consider the data sequence S = [82, 91, 13, 92, 64, 10, 28, 55, 96, 97]. Draw a valid AVL tree for it, assuming that the data has arrived one at the time. Show detailed steps by giving the AVL tree after inserting each element.2. Consider two sets of integers, X = [x1, x2, …, xn] and Y = [y1, y2, …, yn]. Write two versions of a FindSetIntersection(X,Y ) algorithm to find the common elements in both sets. Each of your algorithms should return an array with the common elem …

Order your essay today and save 30% with the discount code: ESSAYHELP
Order your essay today and save 30% with the discount code: ESSAYHELPOrder Now