From 07a085285b0fa44d5392f03ae0cf966b15eeaabe Mon Sep 17 00:00:00 2001
From: jun <2395306536@qq.com>
Date: Tue, 1 Aug 2023 17:08:33 +0800
Subject: [PATCH] update hashmap-source-code.md

---
 docs/java/collection/hashmap-source-code.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/docs/java/collection/hashmap-source-code.md b/docs/java/collection/hashmap-source-code.md
index 8877a451..e7ff46d9 100644
--- a/docs/java/collection/hashmap-source-code.md
+++ b/docs/java/collection/hashmap-source-code.md
@@ -453,7 +453,8 @@ final Node<K,V>[] resize() {
                     // 只有一个节点，直接计算元素新的位置即可
                     newTab[e.hash & (newCap - 1)] = e;
                 else if (e instanceof TreeNode)
-                    // 将红黑树拆分成2棵子树，拆分后的子树节点数小于等于6，则将树转化成链表
+                    // 将红黑树拆分成2棵子树，如果子树节点数小于等于 UNTREEIFY_THRESHOLD（默认为 6），则将子树转换为链表。
+                    // 如果子树节点数大于 UNTREEIFY_THRESHOLD，则保持子树的树结构。
                     ((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
                 else {
                     Node<K,V> loHead = null, loTail = null;