human
I am working on the file "Python/Chapter-07/Heap.ipynb".
The first task is:
The class Node represents a heap of the form $\texttt{Node}(p,v,l,r)$ where
  - $p$ is the <em style="color:blue">priority</em> stored as mPriority,
  - $v$ is the <em style="color:blue">value</em> stored as mValue,
  - $l$ is the <em style="color:blue">left subtree</em> stored as mLeft,
  - $r$ is the <em style="color:blue">right subtree</em> stored as mRight,
  - The number of nodes is stored in the member variable mCount.
Can you write Python code for it?

What is a the Python code you requested?
assistant
#Here is the Python code you requested.

class Node(Heap):
    def __init__(self, priority, value, left, right):
        Heap.__init__(self)
        self.mPriority = priority
        self.mValue    = value
        self.mLeft     = left
        self.mRight    = right
        self.mCount    = left._count() + right._count() + 1
        
    def _extract(self):
        return self.mPriority, self.mValue, self.mLeft, self.mRight
    
    def _count(self):
        return self.mCount
    
    def __str__(self):
        return _make_string(self, ['mPriority', 'mValue', 'mLeft', 'mRight'])