HackerRank Day 22 Solution in Python: Binary Search Trees

class Node:
    def __init__(self,data):
        self.right=self.left=None
        self.data = data
        
class Solution:
    #Method to insert new data
    def insert(self,root,data):
        if root==None:
            return Node(data)
        else:
            if data<=root.data:
                cur=self.insert(root.left,data)
                root.left=cur
            else:
                cur=self.insert(root.right,data)
                root.right=cur
        return root
    
    #Function to get height of the tree
    def getHeight(self,root):
        #If root is null then return -1
        if root is None:
            return -1
        #recursive function call to calculate the height
        left = self.getHeight(root.left)
        right = self.getHeight(root.right)
        return max(left, right) + 1
        
T=int(input())
myTree=Solution()
root=None

#get input from the user for the tree
for i in range(T):
    data=int(input())
    root=myTree.insert(root,data)

#Call the getHeight method
height=myTree.getHeight(root)
#Print the height of the tree
print(height)