Binomial Heap
Computer Science
Level
pending
Suppose that x is a node in a binomial tree within a binomial heap, and assume that sibling[x] ≠ NIL. If x is not a root, how does degree [sibling[x]] compare to degree [x]?
If [sibling[x]] is to the left of x, then degree [sibling[x]] = (degree [x] - 1)
If [sibling[x]] is to the right of x, then degree [sibling[x]] = degree [x]
If [sibling[x]] is to the left of x, then degree [sibling[x]] = (degree [x] + 1)
If [sibling[x]] is to the right of x, then degree [sibling[x]] = (degree [x] + 1)
If [sibling[x]] is to the left of x, then degree [sibling[x]] = degree [x]
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!