algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 04:54:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add automatic linter (#4214)

Browse Source
This commit is contained in:
acbin
2023-06-09 20:05:14 +08:00
committed by GitHub
parent 00282efd8b
commit 415a04ea7f
188 changed files with 661 additions and 1133 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/main/java/com/thealgorithms/devutils/nodes/LargeTreeNode.java
View File

@ -53,8 +53,7 @@ public class LargeTreeNode<E> extends TreeNode<E> {
* @param childNodes {@link Collection} of child Nodes.
* @see TreeNode#TreeNode(Object, Node)
*/
public LargeTreeNode(
E data, LargeTreeNode<E> parentNode, Collection<LargeTreeNode<E>> childNodes) {
public LargeTreeNode(E data, LargeTreeNode<E> parentNode, Collection<LargeTreeNode<E>> childNodes) {
super(data, parentNode);
this.childNodes = childNodes;
}

3
src/main/java/com/thealgorithms/devutils/nodes/SimpleTreeNode.java
View File

@ -57,8 +57,7 @@ public class SimpleTreeNode<E> extends TreeNode<E> {
* @param rightNode Value to which the nodes' right child reference will be
* set.
*/
public SimpleTreeNode(E data, SimpleTreeNode<E> parentNode, SimpleTreeNode<E> leftNode,
SimpleTreeNode<E> rightNode) {
public SimpleTreeNode(E data, SimpleTreeNode<E> parentNode, SimpleTreeNode<E> leftNode, SimpleTreeNode<E> rightNode) {
super(data, parentNode);
this.leftNode = leftNode;
this.rightNode = rightNode;