--- /dev/null	2013-05-10 13:20:43.000000000 -0700
+++ new/src/share/classes/java/util/TreeNode.java	2013-05-10 13:20:43.000000000 -0700
@@ -0,0 +1,56 @@
+/*
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * This file is available under and governed by the GNU General Public
+ * License version 2 only, as published by the Free Software Foundation.
+ * However, the following notice accompanied the original version of this
+ * file:
+ *
+ * Written by Doug Lea with assistance from members of JCP JSR-166
+ * Expert Group and released to the public domain, as explained at
+ * http://creativecommons.org/publicdomain/zero/1.0/
+ */
+
+package java.util;
+
+/*
+ * Code based on CHMv8
+ * 
+ * Node type for TreeBin
+ */
+final class TreeNode<K,V> {
+    TreeNode parent;  // red-black tree links
+    TreeNode left;
+    TreeNode right;
+    TreeNode prev;    // needed to unlink next upon deletion
+    boolean red;
+    HashMap.Entry<K,V> entry;
+
+    TreeNode(HashMap.Entry<K,V> entry, Object next, TreeNode parent) {            
+        this.entry = entry;           
+        this.entry.next = next;
+        this.parent = parent;
+    }
+}