本文整理汇总了C#中RedBlackTree.DepthFirstTraversal方法的典型用法代码示例。如果您正苦于以下问题：C# RedBlackTree.DepthFirstTraversal方法的具体用法？C# RedBlackTree.DepthFirstTraversal怎么用？C# RedBlackTree.DepthFirstTraversal使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类RedBlackTree的用法示例。
在下文中一共展示了RedBlackTree.DepthFirstTraversal方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: DepthFirstTraversalExample
public void DepthFirstTraversalExample()
{
// Create a simple tree
var tree = new RedBlackTree<string, int>
{
new KeyValuePair<string, int>("horse", 4),
new KeyValuePair<string, int>("cat", 1),
new KeyValuePair<string, int>("dog", 2),
new KeyValuePair<string, int>("canary", 3)
};
// Create a tracking visitor which will track the items
// the tree calls visit on.
var visitor = new TrackingVisitor<KeyValuePair<string, int>>();
// We'll wrap the tracking visitor in an ordered visitor and visit
// the items in in-order order. Effectively the visitor would visit
// the items in sorted order.
var inOrderVisitor =
new InOrderVisitor<KeyValuePair<string,int>>(visitor);
// Perform a depth-first traversal of the tree.
tree.DepthFirstTraversal(inOrderVisitor);
// The tracking list has the items in sorted order.
Assert.AreEqual("canary", visitor.TrackingList[0].Key);
Assert.AreEqual("cat", visitor.TrackingList[1].Key);
Assert.AreEqual("dog", visitor.TrackingList[2].Key);
Assert.AreEqual("horse", visitor.TrackingList[3].Key);
}