From f94afe045b46f774c50e04d7c12009ded1aba9e2 Mon Sep 17 00:00:00 2001
From: mikechengwei <842725815@qq.com>
Date: Sun, 24 Sep 2017 20:28:08 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E6=AD=A3=20fd-growth?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 docs/12.使用FP-growth算法来高效发现频繁项集.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/docs/12.使用FP-growth算法来高效发现频繁项集.md b/docs/12.使用FP-growth算法来高效发现频繁项集.md
index ac949ee8..06bb7727 100644
--- a/docs/12.使用FP-growth算法来高效发现频繁项集.md
+++ b/docs/12.使用FP-growth算法来高效发现频繁项集.md
@@ -24,8 +24,8 @@ class treeNode:
         self.count = numOccur     # 节点出现次数
         self.nodeLink = None      # 不同项集的相同项通过nodeLink连接在一起
         # needs to be updated
-        self.parent = parentNode  # 节点的父节点
-        self.children = {}        # 存储儿子节点
+        self.parent = parentNode  # 指向父节点
+        self.children = {}        # 存储叶子节点
 ```   
          
 ## FP-growth 原理