Refactoring.

eminencegrs · Dec 2, 2024 · 8b16844 · 8b16844
1 parent 439aaa0
commit 8b16844
Show file tree

Hide file tree

Showing 3 changed files with 6 additions and 3 deletions.
diff --git a/...94_BinaryTreeInorderTraversal/Solution.cs → ...eeInorderTraversal/BinaryTreeTraverser.cs b/...94_BinaryTreeInorderTraversal/Solution.cs → ...eeInorderTraversal/BinaryTreeTraverser.cs
@@ -1,6 +1,6 @@
 namespace LeetCode.Challenges.Problems00xx.N_0094_BinaryTreeInorderTraversal;
 
-public class Solution
+public class BinaryTreeTraverser
 {
     public IList<int> InorderTraversal(TreeNode? root)
     {

diff --git a/LeetCode/src/LeetCode.Challenges/Problems00xx/N_0094_BinaryTreeInorderTraversal/TreeNode.cs b/LeetCode/src/LeetCode.Challenges/Problems00xx/N_0094_BinaryTreeInorderTraversal/TreeNode.cs
@@ -1,5 +1,8 @@
+using System.Diagnostics.CodeAnalysis;
+
 namespace LeetCode.Challenges.Problems00xx.N_0094_BinaryTreeInorderTraversal;
 
+[ExcludeFromCodeCoverage]
 public class TreeNode(int value = default, TreeNode? left = null, TreeNode? right = null)
 {
     public int Value { get; set; } = value;

diff --git a/...naryTreeInorderTraversal/SolutionTests.cs → ...rderTraversal/BinaryTreeTraverserTests.cs b/...naryTreeInorderTraversal/SolutionTests.cs → ...rderTraversal/BinaryTreeTraverserTests.cs
@@ -4,13 +4,13 @@
 
 namespace LeetCode.Challenges.UnitTests.Problems00xx.N_0094_BinaryTreeInorderTraversal;
 
-public class SolutionTests
+public class BinaryTreeTraverserTests
 {
     [Theory]
     [MemberData(nameof(TestData))]
     public void GivenTree_WhenInorderTraversal_ThenResultAsExpected(TreeNode root, IList<int> expectedResult)
     {
-        var actualResult = new Solution().InorderTraversal(root);
+        var actualResult = new BinaryTreeTraverser().InorderTraversal(root);
         actualResult.ShouldBeEquivalentTo(expectedResult);
     }