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


C# BinaryTree.Postorder方法代码示例

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


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

示例1: Book_PostOrderTraversal_DefaultComparerTest

        public void Book_PostOrderTraversal_DefaultComparerTest()
        {
            List<Book> booksList = new List<Book>()
            {
                new Book(){Author = "Mark Twen", Title = "Oliver Twist",
                    Year = 1935, Publisher = "WilliamsPublish.", PagesQuantity = 350},
                new Book(){Author = "Andew Tanenbaum", Title = "Computer Networks",
                    Year = 2010, Publisher = "ClassicOfComputerScience.", PagesQuantity = 750},
                new Book(){Author = "Gang Of Fours", Title = "Design Patterns",
                    Year = 1995, Publisher = "O'Realy.", PagesQuantity = 520}
            };
            BinaryTree<Book> bt = new BinaryTree<Book>();
            foreach (var item in booksList)
            {
                bt.Add(item);
            }
            List<Book> expectedList = new List<Book>()
            {

                new Book(){Author = "Gang Of Fours", Title = "Design Patterns",
                    Year = 1995, Publisher = "O'Realy.", PagesQuantity = 520},
                new Book(){Author = "Andew Tanenbaum", Title = "Computer Networks",
                    Year = 2010, Publisher = "ClassicOfComputerScience.", PagesQuantity = 750},
                new Book(){Author = "Mark Twen", Title = "Oliver Twist",
                    Year = 1935, Publisher = "WilliamsPublish.", PagesQuantity = 350},
            };
            List<Book> actualList = new List<Book>();
            foreach (var item in bt.Postorder())
            {
                actualList.Add(item);
            }
            CollectionAssert.AreEqual(expectedList,actualList);
        }
开发者ID:VladislavMedved,项目名称:Day9,代码行数:33,代码来源:BinaryTreeTest.cs

示例2: Main

 static void Main(string[] args)
 {
     BinaryTree tree = new BinaryTree();
     Random rnd = new Random();
     for (int i = 0; i < 15; i++)
     {
         tree.Insert(rnd.Next(100));
     }
     Console.WriteLine("Inorder Traversal : ");
     tree.Inorder(tree.ReturnRoot());
     Console.WriteLine(" ");
     Console.WriteLine();
     Console.WriteLine("Preorder Traversal : ");
     tree.Preorder(tree.ReturnRoot());
     Console.WriteLine(" ");
     Console.WriteLine();
     Console.WriteLine("Postorder Traversal : ");
     tree.Postorder(tree.ReturnRoot());
     Console.WriteLine(" ");
     Console.ReadLine();
 }
开发者ID:syhestkiy,项目名称:Kata,代码行数:21,代码来源:Program.cs


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