100%(1)100% нашли этот документ полезным (1 голос)
1K просмотров35 страниц
The largest depth of a Binary Tree of N nodes is O(N) s a complete Binary Tree with height d has, in total, 2d+1-1 nodes. A heap is a tree Where the value at each node is less than or equal to the values at both its descendants.
The largest depth of a Binary Tree of N nodes is O(N) s a complete Binary Tree with height d has, in total, 2d+1-1 nodes. A heap is a tree Where the value at each node is less than or equal …