public void KthSmallestTest1(TreeNode <int> treeRoot, int inputIndex, int expected) { KThSmallest <int> .Result result = new KThSmallest <int> .Result(); KThSmallest <int> .findKThSmallest(treeRoot, inputIndex, result); Assert.Equal(expected, result.item); }
public void KthSmallestTest(TreeNode <int> treeRoot, int inputIndex, int expected) { List <int> list = KThSmallest <int> .inOrderTravese(treeRoot); Assert.Equal(expected, list[inputIndex - 1]); }