Given an array of integers. Create a Binary Search Tree from these numbers. If the inserted value equals to the current node, insert it to the right subtree.
Write a method MaxDepth that finds the maximum depth of a tree. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Write the code according to the next interface:
You can create (use) additional methods if needed.
The first line contains number n (1 ≤ n ≤ 100). The second line contains n integers.
Create the Binary Search Tree from input data. Find and print its maximum depth.