Day 22: Binary Search Trees Python (HackerRank) class Node: def __init__(self,data): self.right=self.left=None self.data = data class Solution: def insert(self,root,data): if root==None: return Node(data) else: if data HackerRank 2021.10.21