1    def makeTree(self, newNode):
2        if self.root == None:
3            self.root = newNode
4        else:
5            ptr = self.root
6            while ptr:
7                if newNode.info > ptr.info: #Go right
8                    if ptr.rthread:
9                        ptr.rthread = False
10                       # save inorder succsessor of ptr
11                       r = ptr.right
12                       ptr.right = newNode
13                       newNode.left = None
14                       #The inorder successor of newNode is
15                       #the previous succsessor of node ptr
16                       newNode.right = r
17                       newNode.rthread = True
18                       break
19                   else:
20                       ptr = ptr.right
21               else:  #Go left
22                   if ptr.left != None:
23                       ptr = ptr.left
24                   else:
25                       ptr.left = newNode
26                       newNode.left = None
27                       #The inorder successor of newNode is ptr
28                       newNode.right = ptr
29                       newNode.rthread = True
30                        break