In c$++,$ create a leftist heap data structure class called LHeap which uses Node class that looks like this:

class Node

$\{$

public:

Node$()$

$\{$

m$\_$key $=0$;

m$\_$data $=0$;

m$\_$npl $=0$;

m$\_$right $=$ nullptr;

m$\_$left $=$ nullptr;

$\}$

Node$($int key, int data$)$

$\{$

m$\_$key $=$ key;

m$\_$data $=$ data;

m$\_$npl $=0$;

m$\_$right $=$ nullptr;

m$\_$left $=$ nullptr;

$\}$

const Node &operator$=($const Node &rhs$)$

$\{$

if $($this $!=$ &rhs$)$

$\{$

m$\_$key $=$ rhs$.$m$\_$key;

m$\_$data $=$ rhs$.$m$\_$data;

m$\_$npl $=$ rhs$.$m$\_$npl;

m$\_$right $=$ rhs$.$m$\_$right;

m$\_$left $=$ rhs$.$m$\_$left;

$\}$

return $*$this;

$\}$

friend class LHeap;

private:

int m$\_$key;

int m$\_$data;

int m$\_$npl;

Node $*$m$\_$right;

Node $*$m$\_$left;

$\}$;

In LHeap class, there should be atleast these functions defined:

findMin$()=$ O$(1)$

$$ deleteMin$()=$ O$($log n$)$

$$ insert$()=$ O$($log n$)$

$$ merge$()=$ O$($log n$)$

$-$ print$()//$ prints the nodes of the leftist heap

Any helper function should be declared as private and any member variable should be private and have $"$m$\_"$ declared before the name. Here is an example of how public and private function for merge works:

Public:

void LHeap::merge$($LHeap $*$h$)\{$

this$>$m$\_$root $=$ merge$($this$>$m$\_$root, h$>$m$\_$root$)$;

$\}$

Private:

Node $*$ LHeap::merge$($Node $*$H$1,$ Node $*$H$2)\{$

if $($H$1==$ NULL$)$ return H$2$;

if $($H$2==$ NULL$)$ return H$1$;

if $($H$1>$m$\_$key $>$ H$2>$m$\_$key$)$

return merge$($H$2,$H$1)$;

H$1>$m$\_$right $=$ merge$($H$1>$m$\_$right,H$2)$;

updateNode$($H$1)$;

return H$1$;

$\}$

Implement all functions of LHeap class in the lheap.cpp and keep the classes itself in lheap.h