On paper, create a binary expression tree to represent the expressions below.

1. 3 + 2
2. 3 + 2 - 10
3. 4 * 3 + 2
4. 4 * 3 + 2 - 10 % 5

1. Take a look at tree-practice.rb
2. Let's walk through how 3 + 2 was created as a binary tree.
3. Let's walk through how print_infix works.
4. Create 4 * 3 + 2 - 10 % 5 in code as a binary tree.

1. Let's write a method that prints out all the operators that exist in the tree.
   • Added Fun: If there are duplicate operators, don't print them separately, but instead print a tally of all operators found.
2. Write a method that returns the count of non-operators (in this case, leaves) in the tree.
   • Added Fun: print the level of the tree that each leaf appears on.
3. Write methods to print the tree in prefix and postfix notations.
4. Write a method that returns whether or not a given operator exists in the tree.
   • Added fun: If the operator occurs more than once, return the count on how many times it occurs - you may return 0 if it doesn't exist in the tree.

1. Code out solutions for problems 1-4 above.

On paper, create a binary search tree (without balancing) adding the following elements in the order provided

1. 1, 4, 5, 2, 9
2. 40, -2, 7, 17, 58, 0
3. 0, -1, 1

Then create these trees in tree-practice.rb

1. Write a method to find the smallest element in a binary search tree.
2. Write a method that returns whether or not a given value exists in the tree.
3. Write a method that determines if a tree is balanced or not.

1. Code out solutions for problems 1 and 2 above
   • Added fun: Code the third problem too!