The PennVet working dog center manages a Binary Search Tree…
The PennVet working dog center manages a Binary Search Tree to monitor the weights of n dogs, where each dog’s weight is represented as a positive distinct integer. The node structure of the tree is defined as follows (additional details omitted): public class DogNode { int weight; DogNode left; DogNode right; /* Constructors */ public DogNode(int weight, DogNode left, DogNode right) { this.weight = weight; this.left = left; this.right = right; } public DogNode(int weight) { this(weight, null, null); }} The Penn staff needs assistance in finding the kth lightest weight dog in this tree (where the root is not null and 1