ListNode

java.lang.Object
- com.sl.algorithms.core.list.ListNode<T>

Type Parameters:

T - : Comparable

All Implemented Interfaces:

java.io.Serializable, java.lang.Comparable<ListNode<T>>
```
public class ListNode<T extends java.lang.Comparable>
extends java.lang.Object
implements java.lang.Comparable<ListNode<T>>, java.io.Serializable
```
Basic representation of a singly LinkedList node.

See Also:

Serialized Form

Field Summary

Fields
Modifier and Type Field and Description

T data
Direct public access for this project only (as it's not a service/app).

ListNode<T> next

Fields
Modifier and Type	Field and Description
`T`	`data` Direct public access for this project only (as it's not a service/app).
`ListNode<T>`	`next`

Constructor Summary

Constructors
Constructor and Description

ListNode(T _data)

Constructors
Constructor and Description
`ListNode(T _data)`

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`ListNode<T>`	`clone()` Deep Copy.
`int`	`compareTo(ListNode<T> o)` Compare only the current node i.e.
`static <T extends java.lang.Comparable> ListNode<T>`	`createLinkedList(T[] objects)`
`static <T extends java.lang.Comparable> ListNode<T>`	`dummyNode()`
`boolean`	`equals(java.lang.Object o)` Deep Equality Assertion.
`int`	`hashCode()`
`boolean`	`isCircular()`
`boolean`	`isCyclic()`
`boolean`	`isDummyNode()`
`ListNode<T>`	`midPoint()` Floyd is great !
`int`	`size()`
`ListNode<T>`	`tail()` Scope: regular or circular list; for cyclic list, use #getEndPointsForCyclicList.
`java.lang.String`	`toString()`

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

- Field Detail
  - data
```
public T extends java.lang.Comparable data
```
    Direct public access for this project only (as it's not a service/app).
  - next
```
public ListNode<T extends java.lang.Comparable> next
```
- Constructor Detail
  - ListNode
```
public ListNode(T _data)
```
- Method Detail
  - dummyNode
```
public static <T extends java.lang.Comparable> ListNode<T> dummyNode()
```
  - createLinkedList
```
public static <T extends java.lang.Comparable> ListNode<T> createLinkedList(T[] objects)
```
    Type Parameters:
    
    T - Comparable
    
    Parameters:
    
    objects - input array
    
    Returns:
    
    head of the list
  - equals
```
public boolean equals(java.lang.Object o)
```
    Deep Equality Assertion.
    
    Overrides:
    
    equals in class java.lang.Object
  - hashCode
```
public int hashCode()
```
    Overrides:
    
    hashCode in class java.lang.Object
  - clone
```
public ListNode<T> clone()
```
    Deep Copy.
    
    Overrides:
    
    clone in class java.lang.Object
  - compareTo
```
public int compareTo(ListNode<T> o)
```
    Compare only the current node i.e. head/root level comparison only.
    For deep equality check, use equals(Object).
    
    Specified by:
    
    compareTo in interface java.lang.Comparable<ListNode<T extends java.lang.Comparable>>
  - toString
```
public java.lang.String toString()
```
    Overrides:
    
    toString in class java.lang.Object
  - size
```
public int size()
```
    Returns:
    
    Length of the list.
  - isCyclic
```
public boolean isCyclic()
```
  - isCircular
```
public boolean isCircular()
```
  - tail
```
public ListNode<T> tail()
```
    Scope: regular or circular list; for cyclic list, use #getEndPointsForCyclicList.
    
    Returns:
    
    tail node of the list
  - isDummyNode
```
public boolean isDummyNode()
```
  - midPoint
```
public ListNode<T> midPoint()
```
    Floyd is great !
    
    Returns:
    
    node at the mid of the list

Class ListNode<T extends java.lang.Comparable>

Field Summary

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Field Detail

data

next

Constructor Detail

ListNode

Method Detail

dummyNode

createLinkedList

equals

hashCode

clone

compareTo

toString

size

isCyclic

isCircular

tail

isDummyNode

midPoint