Update BoundaryTraversal.java

xuyang471 · xuyang471 · commit e5129585fe86 · 2024-10-08T19:28:59.000+08:00
diff --git a/src/main/java/com/thealgorithms/datastructures/trees/BoundaryTraversal.java b/src/main/java/com/thealgorithms/datastructures/trees/BoundaryTraversal.java
@@ -116,7 +116,7 @@ private static void addRightBoundary(BinaryTree.Node node, List<Integer> result)
 
     // Checks if a node is a leaf node
     private static boolean isLeaf(BinaryTree.Node node) {
-        return (node.left == null && node.right == null);
+        return node.left == null && node.right == null;
     }
 
     // Iterative boundary traversal

Original file line number	Diff line number	Diff line change
`@@ -116,7 +116,7 @@ private static void addRightBoundary(BinaryTree.Node node, List<Integer> result)`
`116`	`116`
`117`	`117`	`// Checks if a node is a leaf node`
`118`	`118`	`private static boolean isLeaf(BinaryTree.Node node) {`
`119`		`- return (node.left == null && node.right == null);`
	`119`	`+ return node.left == null && node.right == null;`
`120`	`120`	`}`
`121`	`121`
`122`	`122`	`// Iterative boundary traversal`