public BinaryTree Flatten(BinaryTree root)
{
return(null);
}
public int[][] LevelOrderBottomII(BinaryTree root)
{
return(null);
}
public bool IsBalanced(BinaryTree root)
{
return(false);
}
public int MaxDepth(BinaryTree root)
{
return(-1);
}
public bool IsSameTree(BinaryTree t1, BinaryTree t2)
{
return(false);
}
public bool IsSymmetric(BinaryTree root)
{
return(false);
}
public int[][] PathSum(BinaryTree root, int sum)
{
return(null);
}
public bool HasPathSum(BinaryTree root, int sum)
{
return(false);
}
public int[] InorderTraversal(BinaryTree root)
{
return(null);
}
public bool IsValidBST(BinaryTree root)
{
return(IsValidBST(root, int.MinValue, int.MaxValue));
}
public TreeNodeWithNext Connect(BinaryTree input)
{
return(null);
}
public bool IsValidBST(BinaryTree root)
{
return(false);
}