一題complete binary tree請益

A complete binary tree is defined inductively as follows. A complete binary tree of height 0 consists of 1 node which is the root.A complete binary tree of height h+1 consists of two complete binary tree of height h whose roots are connected to a new root. Let T be a complete binary tree of height h. The height of... 顯示更多 A complete binary tree is defined inductively as follows. A complete binary tree of height 0 consists of 1 node which is the root.A complete binary tree of height h+1 consists of two complete binary tree of height h whose roots are connected to a new root. Let T be a complete binary tree of height h. The height of a node in T is h minus the node's distance from the root(e.g., the root has height h, whereas a leaf has height 0). What is the sum of the heights of all the node in T?

不是很懂這題的意思,希望有人可以幫忙解說一下

萬分感謝
3 個解答 3