Skip to content

Dev06 6 assginment 5 ricardo collado #44

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
RicardoColladoRothschild wants to merge 6 commits into
base: main
Choose a base branch
from
Open

Dev06 6 assginment 5 ricardo collado #44

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
dc68d8c
Assignment 3
orodriguez Feb 14, 2024
53e2fda
Set assignment
orodriguez Feb 14, 2024
fc9c7a3
Implemented Set data structure: Use BStree as base data structure to …
RicardoColladoRothschild Feb 16, 2024
1cb986c
TreeNode: Resolve printing one node
RicardoColladoRothschild Feb 22, 2024
1a254f1
Still working with Print()
RicardoColladoRothschild Feb 23, 2024
e43cd82
Completed: Print(): TreeNode => We use the help of the method Travers…
RicardoColladoRothschild Feb 23, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file added .vs/Dev06_06/FileContentIndex/bcdf3cac-0573-4774-b551-905b21764a02.vsidx
View file
Open in desktop
Binary file not shown.
Binary file added .vs/Dev06_06/FileContentIndex/e7cf06db-a43f-430f-86bf-eefa089d8bff.vsidx
View file
Open in desktop
Binary file not shown.
Binary file added .vs/Dev06_06/v17/.wsuo
View file
Open in desktop
Binary file not shown.
9 changes: 9 additions & 0 deletions .vs/VSWorkspaceState.json
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
{
"ExpandedNodes": [
"",
"\\AAD",
"\\AAD.Tests"
],
"SelectedNode": "\\AAD\\Set.cs",
"PreviewInSolutionExplorer": false
}
Binary file added .vs/slnx.sqlite
View file
Open in desktop
Binary file not shown.
380 changes: 190 additions & 190 deletions AAD.Tests/BSTreeNodeTest.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,191 +1,191 @@
namespace AAD.Tests;

public class BSTreeNodeTest
{
[Fact]
public void Constructor()
{
var n = new BSTreeNode(value: 10);

Assert.Equal(10, n.Value);
Assert.Null(n.Left);
Assert.Null(n.Right);
}

[Fact]
public void Add_RepeatedValue()
{
var n = new BSTreeNode(value: 10);
n.Add(10);

Assert.Null(n.Left);
Assert.Null(n.Right);
}

[Fact]
public void Add_Left()
{
var n = new BSTreeNode(value: 10);
n.Add(5);

Assert.NotNull(n.Left);
Assert.Equal(5, n.LeftValue);

Assert.Null(n.Right);
}

[Fact]
public void Add_LeftIsNotNull()
{
var n = new BSTreeNode(value: 10);
n.Add(5);
n.Add(3);

Assert.Equal(5, n.LeftValue);
var left = n.Left;

Assert.NotNull(left);
Assert.Equal(3, left.LeftValue);
}

[Fact]
public void Add_Right()
{
var n = new BSTreeNode(value: 10);
n.Add(15);

Assert.Null(n.Left);

Assert.NotNull(n.Right);
Assert.Equal(15, n.RightValue);
}

[Fact]
public void Add_RightIsNotNull()
{
var n = new BSTreeNode(value: 10);
n.Add(15);
n.Add(20);

Assert.Equal(15, n.RightValue);
var right = n.Right;

Assert.NotNull(right);
Assert.Equal(20, right.RightValue);
}

[Fact]
public void Contains_OneNode()
{
var n = BSTreeNode
.From(new[] { 15 });

Assert.True(n.Contains(15));
}

[Fact]
public void Contains_InLeft()
{
var n = BSTreeNode
.From(new[] { 15, 5 });

Assert.True(n.Contains(5));
}

[Fact]
public void Contains_InRight()
{
var n = BSTreeNode
.From(new[] { 15, 20 });

Assert.True(n.Contains(20));
}

[Fact]
public void Contains_DotNotExistInLeft()
{
var n = BSTreeNode
.From(new[] { 15 });

Assert.False(n.Contains(5));
}

[Fact]
public void Contains_DotNotExistInRight()
{
var n = BSTreeNode
.From(new[] { 15 });

Assert.False(n.Contains(20));
}

[Fact]
public void TraverseInOrder_OneNode()
{
var root = BSTreeNode
.From(new[] { 15 });

var result = new List<int>();
root.TraverseInOrder(node => result.Add(node.Value));

Assert.Equal(
new[] { 15 },
result.ToArray());
}

[Fact]
public void TraverseInOrder_OneNodeInLeft()
{
var root = BSTreeNode
.From(new[] { 15, 12 });

var result = new List<int>();
root.TraverseInOrder(node => result.Add(node.Value));

Assert.Equal(
new[] { 12, 15 },
result.ToArray());
}

[Fact]
public void TraverseInOrder_Many()
{
var root = BSTreeNode
.From(new[] { 15, 12, 27, 7, 14, 20, 88, 23 });

var result = new List<int>();
root.TraverseInOrder(node => result.Add(node.Value));

Assert.Equal(
new[] { 7, 12, 14, 15, 20, 23, 27, 88 },
result.ToArray());
}

[Fact]
public void TraversePreOrder_Many()
{
var root = BSTreeNode
.From(new[] { 15, 12, 27, 7, 14, 20, 88, 23 });

var result = new List<int>();
root.TraversePreOrder(node => result.Add(node.Value));

Assert.Equal(
new[] { 15, 12, 7, 14, 27, 20, 23, 88 },
result.ToArray());
}

[Fact]
public void TraversePostOrder_Many()
{
var root = BSTreeNode
.From(new[] { 15, 12, 27, 7, 14, 20, 88, 23 });

var result = new List<int>();
root.TraversePostOrder(node => result.Add(node.Value));

Assert.Equal(
new[] { 7, 14, 12, 23, 20, 88, 27, 15 },
result.ToArray());
}
namespace AAD.Tests;
public class BSTreeNodeTest
{
[Fact]
public void Constructor()
{
var n = new BSTreeNode(value: 10);
Assert.Equal(10, n.Value);
Assert.Null(n.Left);
Assert.Null(n.Right);
}
[Fact]
public void Add_RepeatedValue()
{
var n = new BSTreeNode(value: 10);
n.Add(10);
Assert.Null(n.Left);
Assert.Null(n.Right);
}
[Fact]
public void Add_Left()
{
var n = new BSTreeNode(value: 10);
n.Add(5);
Assert.NotNull(n.Left);
Assert.Equal(5, n.LeftValue);
Assert.Null(n.Right);
}
[Fact]
public void Add_LeftIsNotNull()
{
var n = new BSTreeNode(value: 10);
n.Add(5);
n.Add(3);
Assert.Equal(5, n.LeftValue);
var left = n.Left;
Assert.NotNull(left);
Assert.Equal(3, left.LeftValue);
}
[Fact]
public void Add_Right()
{
var n = new BSTreeNode(value: 10);
n.Add(15);
Assert.Null(n.Left);
Assert.NotNull(n.Right);
Assert.Equal(15, n.RightValue);
}
[Fact]
public void Add_RightIsNotNull()
{
var n = new BSTreeNode(value: 10);
n.Add(15);
n.Add(20);
Assert.Equal(15, n.RightValue);
var right = n.Right;
Assert.NotNull(right);
Assert.Equal(20, right.RightValue);
}
[Fact]
public void Contains_OneNode()
{
var n = BSTreeNode
.From(new[] { 15 });
Assert.True(n.Contains(15));
}
[Fact]
public void Contains_InLeft()
{
var n = BSTreeNode
.From(new[] { 15, 5 });
Assert.True(n.Contains(5));
}
[Fact]
public void Contains_InRight()
{
var n = BSTreeNode
.From(new[] { 15, 20 });
Assert.True(n.Contains(20));
}
[Fact]
public void Contains_DotNotExistInLeft()
{
var n = BSTreeNode
.From(new[] { 15 });
Assert.False(n.Contains(5));
}
[Fact]
public void Contains_DotNotExistInRight()
{
var n = BSTreeNode
.From(new[] { 15 });
Assert.False(n.Contains(20));
}
[Fact]
public void TraverseInOrder_OneNode()
{
var root = BSTreeNode
.From(new[] { 15 });
var result = new List<int>();
root.TraverseInOrder(node => result.Add(node.Value));
Assert.Equal(
new[] { 15 },
result.ToArray());
}
[Fact]
public void TraverseInOrder_OneNodeInLeft()
{
var root = BSTreeNode
.From(new[] { 15, 12 });
var result = new List<int>();
root.TraverseInOrder(node => result.Add(node.Value));
Assert.Equal(
new[] { 12, 15 },
result.ToArray());
}
[Fact]
public void TraverseInOrder_Many()
{
var root = BSTreeNode
.From(new[] { 15, 12, 27, 7, 14, 20, 88, 23 });
var result = new List<int>();
root.TraverseInOrder(node => result.Add(node.Value));
Assert.Equal(
new[] { 7, 12, 14, 15, 20, 23, 27, 88 },
result.ToArray());
}
[Fact]
public void TraversePreOrder_Many()
{
var root = BSTreeNode
.From(new[] { 15, 12, 27, 7, 14, 20, 88, 23 });
var result = new List<int>();
root.TraversePreOrder(node => result.Add(node.Value));
Assert.Equal(
new[] { 15, 12, 7, 14, 27, 20, 23, 88 },
result.ToArray());
}
[Fact]
public void TraversePostOrder_Many()
{
var root = BSTreeNode
.From(new[] { 15, 12, 27, 7, 14, 20, 88, 23 });
var result = new List<int>();
root.TraversePostOrder(node => result.Add(node.Value));
Assert.Equal(
new[] { 7, 14, 12, 23, 20, 88, 27, 15 },
result.ToArray());
}
}
Loading