Code in JAVA please!

Q$1-$ Coding Question

$$ In this question you$$ll be making a binary tree to store test scores

$$ Write a node class that will be used in a binary search tree the node class will contain

$$ A reference to it$$s left and right children

$$ Student$$s name as a String

$$ Student$$s test score as an int

$$ Methods to get the left and right children

$$ Methods to get the students name and score

$$ A method to tell whether this is a leaf node or not

$$ A method to get the height of the node $($how many children until the leaf node

starting at this node$)$

$$ Write a class for the binary tree with the following:

$$ A root node

$$ A no arg constructor

$$ A constructor that can take a root node, and it$$s left and right binary tree

$$children$$ and makes that the binary tree

$$ A method to add a node to the tree

$$ When adding nodes to the tree, you will have to decide on whether to put

them to the left or right, a good way to do this is whether the current

node$$s value is less than or greater than the node being added$$s value

$$ A method to get the total height of the tree

$$ A method to get the number of nodes in the tree

$$ Write a test class and add some students into your binary tree

Q$2-$ Discussion Question

What kind of traversal would we do if we wanted to get our test scores in order from smallest to

largest? Would it be the same for largest to smallest $($how would it be different$)?($You can base

it on how you built your tree$$s add method$)$