In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree.

For this assignment, you will need to create three classes. A Node class, A Binary Search Tree class, and Tree app.

Node Class: o It should store the information employee first Name (String), last Name (string), Salary (int) and the ID (int). o Create also respective getters and setters method for the instance variable o Create also constructors as needed

BinarySearchTree Class:

This class should create BST based on the salary of the employee. Once you have created the tree, it should perform the following methods.

A method that returns the employee information, who has the highest salary. A method that returns the employee information, who has the lowest salary.

A method that displays the employee information using pre-order traversal.

A method that displays the employee information using post-order traversal.

A method that return the total number of employee in the organization.

TreeApp (or main class)

This would  that demonstrated the above five methods.

   

A truck carrying a film crew must be driven at the correct velocity to enable the crew to film the underside of the plane. The plane flies at 95km/h at an angle of 20 relative to the ground. How fast is the truck driving?