1.Given an array wordlist of 15 strings in any order, write Java code that creates a full binary tree whose inorder traversal returns the strings in alphabetical order. Hint: Sort the list of strings and then use the eighth string as the root.
2. Design an algorithm that produces a binary expression tree from a given postfix expression. You can assume that the postfix expression is a string that has only binary operators and one-letter operands.
3. Repeat the previous project, but begin with an infix expression instead of a postfix expression.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here