Structure of Fibonacci Heaps: A Fibonacci Heap is a set of heap$-$ordered trees. Trees are not ordered binomial trees, because

Children of a node are unordered

Deleting nodes may destroy binomial construction

Node Structure:

The field $"$ parent" points up one level to the tree node.

The field $"$ key" is the value.

The field "mark" is True if the node has lost a child since the node became a child of another node.

The field "degree" contains the number of children of this node.

The field "child" points down one level to the leftmost node.

The field "left" and "left" points to adjacent node on level.

The structure contains a doubly$-$linked list of sibling nodes.

True

False