int main(){
	Solution s;
	TreeNode* root;
	root = s.Creat();
	s.PreOrder(root);
	cout<<endl;
	cout<<s.maxDepth(root);
	return 0;
}
int main(){
	Solution s;
	TreeNode* root;
	s.Creat(&root);
	s.InOrder(root);
	cout<<endl;
	s.invertTree(root);
	s.InOrder(root);
	return 0;
}