For this lab assignment, you are required to implement the methods specified in the mytree. txt file: 1. create a java file named mytree. java 2. copy the entire code in the mytree. txt and paste to your mytree. java 3. implement the required methods 4. once completed, use the treedriver. class to test your implementations. if you implemented all methods properly, the output should look like: treedriver. class: results height= 3 300 85 22 10 6 after deleting 300: height= 2 85 22 10 6 test balancing method tree before balancing: 9 8 7 6 5 4 3 2 1 after balancing: 9 8 7 6 5 4 3 2 1 tree before balancing: 9 8 6 5 4 3 2 1 0 after balancing: 9 8 6 5 4 3 2 1 0 tree before balancing: 98 78 56 45 9 9 1 0 after balancing: 98 78 56 45 9 9 1 0

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e. g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e. g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s

The two main ways in which marketers address the competition with their strategies are by satisfying a need better than a competition and by

Gabe wants to move text from one document to another document. he should copy the text, paste the text, and open the new document highlight the text, select the cut command, move to the new document, make sure the cursor is in the correct location, and select the paste command select the save as command, navigate to the new document, and click save highlight the text, open the new document, and press ctrl and v