Consider the Binary Search Tree method DepthEqual(T) that outputs all node values in a binary search tree T such that the value stored in the node is equal to the depth of the node in the tree.

Consider the Binary Search Tree method DepthEqual(T) that outputs all node values in a binary search tree T such that the value stored in the node is equal to the depth of the node in the tree. The values can be any integer, including negative numbers.

Show pseudocode for an efficient implementation of DepthEqual(T). Hint: For a node n at depth d, whose value is v. if d >= v. then there is no need to search n's left subtree