修改文件: _posts/2016-10-16-count-complete-tree-nodes.md

lanyuanxiaoyao · lanyuanxiaoyao · commit 062c5b47296b · 2017-03-25T01:50:27.000+08:00
diff --git a/_posts/2016-10-16-count-complete-tree-nodes.md b/_posts/2016-10-16-count-complete-tree-nodes.md
@@ -6,6 +6,10 @@ categories: LeetCode
 tags: [LeetCode,Medium,二叉树,计数,递归]
 ---
 
+* content
+{:toc}
+
+
 >Given a **complete** binary tree, count the number of nodes.
 给定一个完全二叉树，计算其节点数
 
