#include<iostream>

#include<stdio.h>
#include<stdlib.h>
#include<iomanip>
#include<vector>
#include<math.h>
#include<fstream>
#include<string>
#include<limits.h>
#include<climits>
#include<algorithm>
#include<unordered_set>

using namespace std;

struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
int main()
{
Solution s;
return 0;
}

TreeNode
TreeNode
TreeNode
TreeNode
TreeNode

*root =
*child2
*child3
*child4
*child5

new TreeNode(1);
= new TreeNode(2);
= new TreeNode(3);
= new TreeNode(4);
= new TreeNode(5);

root->left = child2;
root->right = child3;
child2->left = child4;
child2->right = child5;