int longestConsecutive(TreeNode* root) {
int ans = 0;
gao(root, ans);
return ans;
}
int
main (void)
{
return *gao ();
}
int longestConsecutive(TreeNode* root) {
int ans = 0;
gao(root, ans);
return ans;
}
int
main (void)
{
return *gao ();
}