b

#include using namespace std; struct node { public: long value; node left; node right; int deep; node(long value){ this->value = value; this->deep = 0; } node(node n1,node n2,long value){ this->left = n1; this->right = n2; this->value = value; } }; class main{

} int main() { return 0; }

#include #include #include using namespace std; template class cmp { public: //重载 () 运算符 bool operator()(T a, T b) { return a > b; } };

class MyNode { long val; long depth; class MyNode *left; class MyNode *right; public: MyNode(long val){ this->val = val; this->left = NULL; this->right = NULL; } };

MyNode createHFTRee(queue& counts){

return NULL; } long sum = 0;

int main() { int n; cin>>n; queue counts; for(int i =0;i<n;i++) { long m; cin>>m; MyNode node(m);
counts.push(node); } return 0; }