Today we talked about how to implement a decrease_key. This implementation will give us tree that is no longer binomial tree. But it will still have the property that suppose the children of a node is sorted according to its degree, then the i-th has degree at least i-2. (An alternative definition of binomial tree is that its ith child has degree exact i-1). We call any tree of above property Fibonacci Tree.
No comments:
Post a Comment