当前位置: 首页>>代码示例>>C#>>正文


C# BinarySearchTree.DepthFirstTraversal方法代码示例

本文整理汇总了C#中BinarySearchTree.DepthFirstTraversal方法的典型用法代码示例。如果您正苦于以下问题:C# BinarySearchTree.DepthFirstTraversal方法的具体用法?C# BinarySearchTree.DepthFirstTraversal怎么用?C# BinarySearchTree.DepthFirstTraversal使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在BinarySearchTree的用法示例。


在下文中一共展示了BinarySearchTree.DepthFirstTraversal方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C#代码示例。

示例1: Simple

        public void Simple()
        {
            var tree = new BinarySearchTree<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)
                           };

            var visitor = new TrackingVisitor<KeyValuePair<string, int>>();

            var inOrderVisitor =
                new InOrderVisitor<KeyValuePair<string, int>>(visitor);

            tree.DepthFirstTraversal(inOrderVisitor);

            Assert.AreEqual(visitor.TrackingList[0].Key, "canary");
            Assert.AreEqual(visitor.TrackingList[1].Key, "cat");
            Assert.AreEqual(visitor.TrackingList[2].Key, "dog");
            Assert.AreEqual(visitor.TrackingList[3].Key, "horse");
        }
开发者ID:havok,项目名称:ngenerics,代码行数:22,代码来源:DepthFirstTraversal.cs

示例2: DepthFirstTraversalExample

        public void DepthFirstTraversalExample()
        {
            // Create a simple tree
            BinarySearchTreeBase<string, int> tree = new BinarySearchTree<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);
        }
开发者ID:havok,项目名称:ngenerics,代码行数:30,代码来源:BinarySearchTreeBaseExamples.cs


注:本文中的BinarySearchTree.DepthFirstTraversal方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。