(self, key)
| 81 | self.root = None |
| 82 | |
| 83 | def addUsingKey(self, key): |
| 84 | treenode = TreeNode(key) |
| 85 | if self.root == None: |
| 86 | self.root = treenode |
| 87 | else: |
| 88 | buff = self.root |
| 89 | current =self.root |
| 90 | while current != None: |
| 91 | if current.key < treenode.key: |
| 92 | buff = current |
| 93 | current = current.right |
| 94 | else: |
| 95 | buff = current |
| 96 | current = current.left |
| 97 | if buff.key < treenode.key: |
| 98 | buff.right = treenode |
| 99 | treenode.p = buff |
| 100 | else: |
| 101 | buff.left = treenode |
| 102 | treenode.p = buff |
| 103 | |
| 104 | def inorderSucc(treenode): |
| 105 | if treenode != None: |