本文整理汇总了C#中BinaryTree.GetDeepFirstOrder方法的典型用法代码示例。如果您正苦于以下问题：C# BinaryTree.GetDeepFirstOrder方法的具体用法？C# BinaryTree.GetDeepFirstOrder怎么用？C# BinaryTree.GetDeepFirstOrder使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinaryTree的用法示例。
在下文中一共展示了BinaryTree.GetDeepFirstOrder方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: GetDeepFirstOrder_ShouldReturnExpectedList
public void GetDeepFirstOrder_ShouldReturnExpectedList()
{
//Arrange
var sut = new BinaryTree(1);
var root = sut.GetRoot();
var node2 = sut.AddLeftChild(2, root);
var node3 = sut.AddRightChild(3, root);
var node4 = sut.AddLeftChild(4, node2);
var node5 = sut.AddRightChild(5, node3);
var node6 = sut.AddLeftChild(6, node4);
var node7 = sut.AddRightChild(7, node4);
var node8 = sut.AddRightChild(8, node5);
var node9 = sut.AddLeftChild(9, node8);
var node10 = sut.AddRightChild(10, node8);
var controlList = new List<int>
{
1, 2, 4, 6, 7, 3, 5, 8, 9, 10
};
//Act
var resultsList = new List<int>();
resultsList = sut.GetDeepFirstOrder(resultsList, root);
//Assert
CollectionAssert.AreEqual(controlList, resultsList);
}