LeetCode_Algorithms_104_Maximum_Depth_of_Binary_Tree_TestCase3.cs

[TestMethod]
public void Tree11101010010_Return4()
{
    No104_MaximumDepthofBinaryTree.TreeNode root = new No104_MaximumDepthofBinaryTree.TreeNode(1);
    root.left = new No104_MaximumDepthofBinaryTree.TreeNode(1);
    root.right = new No104_MaximumDepthofBinaryTree.TreeNode(1);
    root.left.right = new No104_MaximumDepthofBinaryTree.TreeNode(1);
    root.right.right = new No104_MaximumDepthofBinaryTree.TreeNode(1);
    root.left.right.left = new No104_MaximumDepthofBinaryTree.TreeNode(1);
    int depth = solution.MaxDepth(root);
    Assert.AreEqual(4, depth);
}