52       left:  GeneratePayloadTree(depth - 1, key),
167     node.left = this.root_;
172     node.left = this.root_.left;
173     this.root_.left = null;
196   if (!this.root_.left) {
200     this.root_ = this.root_.left;
242   } else if (this.root_.left) {
243     return this.findMax(this.root_.left);
281   var dummy, left, right;
282   dummy = left = right = new SplayTree.Node(null, null);
286       if (!current.left) {
289       if (key < current.left.key) {
291         var tmp = current.left;
292         current.left = tmp.right;
295         if (!current.left) {
300       right.left = current;
302       current = current.left;
310         current.right = tmp.left;
311         tmp.left = current;
318       left.right = current;
319       left = current;
326   left.right = current.left;
327   right.left = current.right;
328   current.left = dummy.right;
329   current.right = dummy.left;
349 SplayTree.Node.prototype.left = null;  method in SplayTree.Node
368     var left = current.left;
369     if (left) left.traverse_(f);