1. Write a method height in the Binary Tree class that returns the height of a binary tree. The height of an empty tree is 0. If the tree is not empty, the height of the tree is the number of nodes along the path from the root to the deepest leaf. Your method should have the following signature: public int height () 2. Write the implementation of the breadth-first binary tree traversal. Recall the pseudocode for a breadth-first traversal: Algorithm breadth_first (T): initialize queue Q to contain root while Q not empty do p = Q.dequeue () wwwwwwwww visit p for each child c in children (p) do Q.enqueue (c) wwwwwww You should use the LinkedQueue implementation of the Queue ADT for this part of the lab. wwwwwww 3. As you learned in lectures, one of the binary tree applications is expression trees. In this lab session, implement ExpressionTree ADT that support the following: . . Construct expression tree from postfix expression. Construct expression tree from infix expression. Print expression using infix notation. Print expression using postfix notation. Print expression using prefix notation. Evaluate expression; assume the all the operands are numbers Task: Implement and test Expression Tree class. This class has one attribute for the tree root. Hint: Define class Node as a nested class of the Expression Tree.