Let a be an F-heap with n elements that results from a sequence of insert,
meld, delete min, and decrease key operations performed on initially empty
F-heap.
Let b be any node in any of the min-trees of a
the degree of b is at most log(φ)(m) // 以φ為底
where φ = ( 1 + √5 ) / 2
m is the number of elements in the subtree with root b.
請問要怎麼證明the degree of b is at most log(φ)(m)呢?
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.166.113.243