https://blog.youkuaiyun.com/kaifa1321zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/kaifa1321/article/details/80428205https://blog.youkuaiyun.com/kaifa1321/article/details/80428205kaifa1321Wed, 23 May 2018 23:35:34 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/80428183https://blog.youkuaiyun.com/kaifa1321/article/details/80428183kaifa1321Wed, 23 May 2018 23:32:40 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/80428150https://blog.youkuaiyun.com/kaifa1321/article/details/80428150kaifa1321Wed, 23 May 2018 23:30:02 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/80428144https://blog.youkuaiyun.com/kaifa1321/article/details/80428144kaifa1321Wed, 23 May 2018 23:29:11 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/80428107https://blog.youkuaiyun.com/kaifa1321/article/details/80428107kaifa1321Wed, 23 May 2018 23:26:15 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/80428077https://blog.youkuaiyun.com/kaifa1321/article/details/80428077kaifa1321Wed, 23 May 2018 23:23:17 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/80428008https://blog.youkuaiyun.com/kaifa1321/article/details/80428008kaifa1321Wed, 23 May 2018 23:21:28 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/79914014https://blog.youkuaiyun.com/kaifa1321/article/details/79914014kaifa1321Thu, 12 Apr 2018 15:04:09 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/79761507https://blog.youkuaiyun.com/kaifa1321/article/details/79761507kaifa1321Fri, 30 Mar 2018 18:18:15 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/79747145https://blog.youkuaiyun.com/kaifa1321/article/details/79747145kaifa1321Thu, 29 Mar 2018 18:42:48 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/79683246https://blog.youkuaiyun.com/kaifa1321/article/details/79683246kaifa1321Tue, 27 Mar 2018 14:11:04 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/79622715https://blog.youkuaiyun.com/kaifa1321/article/details/79622715kaifa1321Tue, 20 Mar 2018 11:08:49 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/72453165https://blog.youkuaiyun.com/kaifa1321/article/details/72453165kaifa1321Wed, 17 May 2017 21:30:05 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/70948030https://blog.youkuaiyun.com/kaifa1321/article/details/70948030kaifa1321Sat, 29 Apr 2017 13:15:15 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/70666265https://blog.youkuaiyun.com/kaifa1321/article/details/70666265kaifa1321Mon, 24 Apr 2017 22:21:45 +0800=1； 深度为h的二叉树最多有 个结点(h>=1)，最少有h个结点； 对于任意一棵二叉树，如果其叶结点数为N0，而度数为2的结点总数为N2，则N0=N2+1； 具有n个结点的完全二叉树的深度为]]>https://blog.youkuaiyun.com/kaifa1321/article/details/70596645https://blog.youkuaiyun.com/kaifa1321/article/details/70596645kaifa1321Mon, 24 Apr 2017 21:47:25 +0800=0）个有限节点组成一个具有层次关系的集合。当n=0时，这棵树被称之为空树。树它具有以下的特点： 每个节点有零个或多个子节点； 没有父节点的节点称为根节点； 每一个非根节点有且只有一个父节点； 除了根节点外，每个子节点可以分为多个不相交的子树； 树的相关属性结点的度 结点拥有的子树数称为结点的度。 度为0的结点称为叶子结点或终端结点，度不为0的结点称为非终端结点或分支结点。 除]]>https://blog.youkuaiyun.com/kaifa1321/article/details/70557503https://blog.youkuaiyun.com/kaifa1321/article/details/70557503kaifa1321Sun, 23 Apr 2017 23:38:45 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/70502563https://blog.youkuaiyun.com/kaifa1321/article/details/70502563kaifa1321Sun, 23 Apr 2017 15:33:46 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/62427592https://blog.youkuaiyun.com/kaifa1321/article/details/62427592kaifa1321Mon, 20 Mar 2017 14:51:49 +0800https://blog.youkuaiyun.com/kaifa1321/article/details/53455525https://blog.youkuaiyun.com/kaifa1321/article/details/53455525kaifa1321Sun, 04 Dec 2016 18:06:53 +0800