public void Test(string inputStr, int expected)
{
var input = BinaryTreeConvert.Deserialize(inputStr);
var s = new Solution();
s.SumOfLeftLeaves(input).Should().Be(expected);
}
public void Test(string inputStr, string expected)
{
var output = RecoverFromPreorder(inputStr);
var outputStr = BinaryTreeConvert.Serialize(output);
outputStr.Should().Be(expected);
}
public void Test_1()
{
var input = BinaryTreeConvert.Deserialize("5,4,8,11,null,13,4,7,2,null,null,null,1");
var output = HasPathSum(input, 22);
output.Should().Be(true);
}
public void Test(string inputStr, string expectedStr)
{
var input = BinaryTreeConvert.Deserialize(inputStr);
var output = VerticalTraversal(input);
var outputStr = JsonConvert.SerializeObject(output);
outputStr.Should().Be(expectedStr);
}
public void Test(string inputStr, int key, string expected)
{
var root = BinaryTreeConvert.Deserialize(inputStr);
var s = new Solution();
var output = s.DeleteNode(root, key);
var outputStr = BinaryTreeConvert.Serialize(output);
outputStr.Should().Be(expected);
}
public void Test(string inputStr, string inputStr2, string expectedStr)
{
var input = BinaryTreeConvert.Deserialize(inputStr);
var input2 = JsonConvert.DeserializeObject <int[]>(inputStr2);
var expected = JsonConvert.DeserializeObject <bool[]>(expectedStr);
var s = new FindElements(input);
for (var i = 0; i < input2.Length; i++)
{
s.Find(input2[i]).Should().Be(expected[i]);
}
}
public void Test_Dfs(string inputStr, int expected)
{
var root = BinaryTreeConvert.Deserialize(inputStr);
DeepestLeavesSumDfs(root).Should().Be(expected);
}
[DataRow("6,7,8,2,7,1,3,9,null,1,4,null,null,null,5", 18)] // 2,7,1,3,5
public void Test(string inputStr, int expected)
{
var input = BinaryTreeConvert.Deserialize(inputStr);
SumEvenGrandparent(input).Should().Be(expected);
}
public void Test_1(string inputStr, int expected)
{
var input = BinaryTreeConvert.Deserialize(inputStr);
MaxDepth(input).Should().Be(expected);
}
