mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-24 04:54:21 +08:00
@ -25,7 +25,6 @@ public class ProcessDetails {
|
||||
return burstTime;
|
||||
}
|
||||
|
||||
|
||||
public int getWaitingTime() {
|
||||
return waitingTime;
|
||||
}
|
||||
|
@ -54,10 +54,7 @@ public class LargeTreeNode<E> extends TreeNode<E> {
|
||||
* @see TreeNode#TreeNode(Object, Node)
|
||||
*/
|
||||
public LargeTreeNode(
|
||||
E data,
|
||||
LargeTreeNode<E> parentNode,
|
||||
Collection<LargeTreeNode<E>> childNodes
|
||||
) {
|
||||
E data, LargeTreeNode<E> parentNode, Collection<LargeTreeNode<E>> childNodes) {
|
||||
super(data, parentNode);
|
||||
this.childNodes = childNodes;
|
||||
}
|
||||
|
@ -20,7 +20,8 @@ public abstract class Node<E> {
|
||||
/**
|
||||
* Empty constructor.
|
||||
*/
|
||||
public Node() {}
|
||||
public Node() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Initializes the Nodes' data.
|
||||
|
@ -57,12 +57,8 @@ 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;
|
||||
|
Reference in New Issue
Block a user