1    def insertNode(self, newNode):
2        if self.isEmpty():
3            self.root = newNode
4            self.size += 1
5        else:
6             ptr = self.root
7             while ptr:
8                 if newNode.key > ptr.key: #insert into right subtree
9                     if ptr.right != None:
10                        ptr = ptr.right
11                    else:
12                        ptr.right = newNode
13                        break
14                else:   #insert into the left subtrt
15                    if ptr.left != None:
16                        ptr = ptr.left
17                    else:
18                        ptr.left = newNode
19                        break
20            self.size += 1