Subject. Data structure

ASAP please

Handwritten is ok.

Thanks

27. (10 points) Given a Binary Tree defined to store integers, write the code to find and returm the depth in th type of binary tree with the smallest sum, the method minimumSumDepth. This method will be a method of the Binary Tree class as defined below. This method will have to compute the sum of all the values a depth. In the example below, the sum at depth deti 2 s 117 which means minimumSumDepth would return 1. Assume this method always begins its search at the on node of the tree. If the tree is empty then have minimumSumDepth return -1. You do not need to use ny other method of this Binary Tree class except for what you see below, You can use any other class structures as needed ac 0 is 50, the sum at depth 1 is 8, and the sum at 50 -Depth o -Depth 1 30 7) -Depth 2 80 public class BinaryTree rivate static class Node private int data private Node left private Node right publie int getData) return data: ) public Node getLef) (return left: publie Node getRight) (return right: h private Node root