Lines Matching full:left
86 node.left = this.root_;
91 node.left = this.root_.left;
92 this.root_.left = null;
115 if (!this.root_.left) {
119 this.root_ = this.root_.left;
154 while (current.left) {
155 current = current.left;
188 // the left subtree.
191 } else if (this.root_.left) {
192 return this.findMax(this.root_.left);
225 // the L tree of the algorithm. The left child of the dummy node
226 // will hold the R tree of the algorithm. Using a dummy node, left
228 var dummy, left, right;
229 dummy = left = right = new goog.structs.SplayTree.Node(null, null);
233 if (!current.left) {
236 if (key < current.left.key) {
238 var tmp = current.left;
239 current.left = tmp.right;
242 if (!current.left) {
247 right.left = current;
249 current = current.left;
255 // Rotate left.
257 current.right = tmp.left;
258 tmp.left = current;
264 // Link left.
265 left.right = current;
266 left = current;
273 left.right = current.left;
274 right.left = current.right;
275 current.left = dummy.right;
276 current.right = dummy.left;
295 nodesToVisit.push(node.left);
316 goog.structs.SplayTree.Node.prototype.left = null;
