當前位置: 首頁>>代碼示例>>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;未經允許,請勿轉載。