Part 1 We provided a file BinaryTree.java that defines a class for a binary tree and some methods. The method insertNode () inserts a node in the leftmost available free spot. That is, if the method is called in the following sequence: insertNode(50), insertNode (2), insertNode (34), insertNode(19), insertNode (6), then the tree will look like: 50 34 19 And, if we call insertNode (22), the tree will look like