The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height :Function DescriptionComplete the getHeight or height function in the editor. It must return the height of a binary tree as an integer.getHeight or height has the following parameter(s):root: a reference to the root of a binary tree.Note -The Height of binary tree with single node is taken as zero.Input FormatThe first line contains an integer , the number of nodes in the tree.Next line contains space separated integer where th integer denotes node[i].data.Note: Node values are inserted into a binary search tree before a reference to the tree's root node is passed to your function. In a binary search tree, all nodes on the left branch of a node are less than the node value. All values on the right branch are greater than the node value.ConstraintsOutput FormatYour function should return a single integer denoting the height of the binary tree.

To find the height of a binary tree, we need to count the number of edges between the root and the furthest leaf.

To solve this problem, we can define a recursive function called "getHeight" or "height" that takes a reference to the root of the binary tree as a parameter.

Here are the steps to implement the function:

1. Start by checking if the root is null. If it is, return -1, as there are no edges in an empty tree.

2. If the root is not null, recursively call the "getHeight" or "height" function on the left and right subtrees of the root.

3. Take the maximum of the heights of the left and right subtrees and add 1 to it. This represents the height of the current root.

4. Return the calculated height.

Note that the height of a binary tree with a single node is considered to be 0.

The input format for this problem consists of the number of nodes in the tree, followed by the values of the nodes in space-separated format.

The output format is a single integer representing the height of the binary tree.

I hope this helps!