static void Opgave4() { System.Console.WriteLine("\n===== Opgave 4 : NumberOfNodes =====\n"); IBinaryTree <int> intTree; IBinaryTree <string> stringTree; // Empty tree intTree = DSBuilder.CreateBinaryTreeEmpty(); System.Console.WriteLine(intTree.NumberOfLeaves()); System.Console.WriteLine(intTree.NumberOfNodesWithOneChild()); System.Console.WriteLine(intTree.NumberOfNodesWithTwoChildren()); // Int tree intTree = DSBuilder.CreateBinaryTreeInt(); System.Console.WriteLine(intTree.NumberOfLeaves()); System.Console.WriteLine(intTree.NumberOfNodesWithOneChild()); System.Console.WriteLine(intTree.NumberOfNodesWithTwoChildren()); // String tree stringTree = DSBuilder.CreateBinaryTreeString(); System.Console.WriteLine(stringTree.NumberOfLeaves()); System.Console.WriteLine(stringTree.NumberOfNodesWithOneChild()); System.Console.WriteLine(stringTree.NumberOfNodesWithTwoChildren()); }
static void Opgave3() { System.Console.WriteLine("\n===== Opgave 3 : BinaryTree =====\n"); IBinaryTree <int> intTree; IBinaryTree <string> stringTree; // Empty tree intTree = DSBuilder.CreateBinaryTreeEmpty(); System.Console.WriteLine(intTree.Size()); System.Console.WriteLine(intTree.Height()); System.Console.WriteLine(intTree.ToPrefixString()); System.Console.WriteLine(intTree.ToInfixString()); System.Console.WriteLine(intTree.ToPostfixString()); // Int tree intTree = DSBuilder.CreateBinaryTreeInt(); System.Console.WriteLine(intTree.Size()); System.Console.WriteLine(intTree.Height()); System.Console.WriteLine(intTree.ToPrefixString()); System.Console.WriteLine(intTree.ToInfixString()); System.Console.WriteLine(intTree.ToPostfixString()); System.Console.WriteLine(intTree.NumberOfNodesWithOneChild()); // String tree stringTree = DSBuilder.CreateBinaryTreeString(); System.Console.WriteLine(stringTree.Size()); System.Console.WriteLine(stringTree.Height()); System.Console.WriteLine(stringTree.ToPrefixString()); System.Console.WriteLine(stringTree.ToInfixString()); System.Console.WriteLine(stringTree.ToPostfixString()); }
public void BinaryTree_03_MakeEmpty_GetRootIsNullAfterMakeEmpty() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); // Act tree.MakeEmpty(); // Assert Assert.Throws(typeof(BinarySearchTreeEmptyException), () => tree.GetRoot()); }
public void BinaryTree_02_Size_2_OnIntTree() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); int expected = 6; // Act int actual = tree.Size(); // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_10_NumberOfNodesWithTwoChildren_2_OnIntTree() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); int expected = 2; // Act int actual = tree.NumberOfNodesWithTwoChildren(); // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_01_GetRoot_2_OnIntTree_2_DataCorrect() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); int expected = 5; // Act int actual = tree.GetRoot().data; // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_08_NumberOfLeaves_2_OnIntTree() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); int expected = 3; // Act int actual = tree.NumberOfLeaves(); // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_07_ToPostfixString_2_OnIntTree() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); string expected = "[ [ [ NIL NIL 8 ] [ [ NIL NIL 1 ] NIL 7 ] 2 ] [ NIL NIL 6 ] 5 ]"; // Act string actual = tree.ToPostfixString(); // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_06_ToInfixString_2_OnIntTree() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); string expected = "[ [ [ NIL 8 NIL ] 2 [ [ NIL 1 NIL ] 7 NIL ] ] 5 [ NIL 6 NIL ] ]"; // Act string actual = tree.ToInfixString(); // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_01_GetRoot_2_OnIntTree_1_NotNull() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); BinaryNode <int> not_expected = null; // Act BinaryNode <int> actual = tree.GetRoot(); // Assert Assert.AreNotEqual(not_expected, actual); }
public void BinaryTree_05_ToPrefixString_2_OnIntTree() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); string expected = "[ 5 [ 2 [ 8 NIL NIL ] [ 7 [ 1 NIL NIL ] NIL ] ] [ 6 NIL NIL ] ]"; // Act string actual = tree.ToPrefixString(); // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_04_IsEmpty_2_OnIntTree() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); bool expected = false; // Act bool actual = tree.IsEmpty(); // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_03_MakeEmpty_GetRootIsNullAfterMakeEmpty() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); BinaryNode <int> expected = null; // Act tree.MakeEmpty(); BinaryNode <int> actual = tree.GetRoot(); // Assert Assert.AreEqual(expected, actual); }
public void BinaryTree_04_IsEmpty_4_AfterMakeClean() { // Arrange IBinaryTree <int> tree = DSBuilder.CreateBinaryTreeInt(); bool expected = true; tree.MakeEmpty(); // Act bool actual = tree.IsEmpty(); // Assert Assert.AreEqual(expected, actual); }