How can I make a binary search tree of a java program that can, in theory, store objects of any class (use templates)?

Question 1 5 pts A regular expression is shorthand for a set of strings. For example (b+ba)* ba (a+ab)* represents a set of strings for which the first two elements (when listed in length order with same length strings listed in alphabetical order) are: ba and baa. What are the next three strings in this sequence? Next string: Next after that: Next after that:

You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…

Building a histogram. Write a python program to find the number of occurrences of each word in a text file. The first part of the task is to open the file, then create a dictionary to read each word from the file and compute the word's frequency (consider words written in capital letters equal words written in lower case). At the end build two lists, one with each word in the file (call it words_list) and a second list with the number of occurrences of the word in the file (call it words_count). Do not make distinction among words with capital letters. \n",