Lines Matching full:left
35 self.left = None
72 node.left = self.root
77 node.left = self.root.left
78 self.root.left = None
93 if not self.root.left:
94 # No left child, so the new tree is just the right child.
97 # Left child exists.
99 # Make the original left child the new root.
100 self.root = self.root.left
131 while current.left != None:
132 current = current.left
143 # the left subtree.
148 self.root = self.root.left
162 nodes_to_visit.append(node.left)
183 # the L tree of the algorithm. The left child of the dummy node
184 # will hold the R tree of the algorithm. Using a dummy node, left
186 dummy = left = right = Node(None, None)
190 if not current.left:
192 if key < current.left.key:
194 tmp = current.left
195 current.left = tmp.right
198 if not current.left:
201 right.left = current
203 current = current.left
208 # Rotate left.
210 current.right = tmp.left
211 tmp.left = current
215 # Link left.
216 left.right = current
217 left = current
222 left.right = current.left
223 right.left = current.right
224 current.left = dummy.right
225 current.right = dummy.left
