Lines Matching full:right
36 self.right = None
73 node.right = self.root.right
74 self.root.right = None
76 node.right = self.root
94 # No left child, so the new tree is just the right child.
95 self.root = self.root.right
98 right = self.root.right
101 # Splay to make sure that the new root has an empty right child.
103 # Insert the original right child as the right child of the new
105 self.root.right = right
122 while current.right != None:
123 current = current.right
163 nodes_to_visit.append(node.right)
182 # counter-intuitive: The right child of the dummy node will hold
185 # and right will always be nodes and we avoid special cases.
186 dummy = left = right = Node(None, None)
193 # Rotate right.
195 current.left = tmp.right
196 tmp.right = current
200 # Link right.
201 right.left = current
202 right = current
205 if not current.right:
207 if key > current.right.key:
209 tmp = current.right
210 current.right = tmp.left
213 if not current.right:
216 left.right = current
218 current = current.right
222 left.right = current.left
223 right.left = current.right
224 current.left = dummy.right
225 current.right = dummy.left
