本文整理汇总了C#中BinarySearchTree.DepthFirstSearchEnumerator方法的典型用法代码示例。如果您正苦于以下问题：C# BinarySearchTree.DepthFirstSearchEnumerator方法的具体用法？C# BinarySearchTree.DepthFirstSearchEnumerator怎么用？C# BinarySearchTree.DepthFirstSearchEnumerator使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinarySearchTree的用法示例。
在下文中一共展示了BinarySearchTree.DepthFirstSearchEnumerator方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: CanEnumerateDepthFirstSearch
public void CanEnumerateDepthFirstSearch()
{
var tree = new BinarySearchTree<int, int>(new[] {3, 2, 1, 2, 4, 3}.AsKeyValueList());
var expected = new[] {3, 2, 1, 2, 4, 3};
CollectionAssert.AreEqual(expected, tree.DepthFirstSearchEnumerator().Select(_ => _.Value).ToList());
}示例2: AppearInRootAfterAddingFirstElement
public void AppearInRootAfterAddingFirstElement()
{
var tree = new BinarySearchTree<int, int>();
var element = 1.AsKeyValue();
tree.Insert(element);
Assert.IsTrue(tree.BreadthFirstSearchEnumerator().Contains(element));
Assert.IsTrue(tree.DepthFirstSearchEnumerator().Contains(element));
}示例3: CountInEnumeratorsMustMatchCountInTree
public void CountInEnumeratorsMustMatchCountInTree()
{
var tree = new BinarySearchTree<int, int>();
tree.Insert(1.AsKeyValue());
tree.Insert(3.AsKeyValue());
tree.Insert(2.AsKeyValue());
Assert.AreEqual(3, tree.BreadthFirstSearchEnumerator().Count());
Assert.AreEqual(3, tree.DepthFirstSearchEnumerator().Count());
}