LinkedListNode<T> Class
Important
Some information relates to prerelease product that may be substantially modified before it’s released. Microsoft makes no warranties, express or implied, with respect to the information provided here.
Represents a node in a LinkedList<T>. This class cannot be inherited.
generic <typename T>
public ref class LinkedListNode sealed
public sealed class LinkedListNode<T>
[System.Runtime.InteropServices.ComVisible(false)]
public sealed class LinkedListNode<T>
type LinkedListNode<'T> = class
[<System.Runtime.InteropServices.ComVisible(false)>]
type LinkedListNode<'T> = class
Public NotInheritable Class LinkedListNode(Of T)
- T
Specifies the element type of the linked list.
- Inheritance
-
LinkedListNode<T>
- Attributes
The following code example creates a LinkedListNode<T>, adds it to a LinkedList<T>, and tracks the values of its properties as the LinkedList<T> changes.
#using <System.dll>
using namespace System;
using namespace System::Collections::Generic;
public ref class GenericCollection {
public:
static void Main() {
// Create a new LinkedListNode of type String and displays its properties.
LinkedListNode<String^>^ lln = gcnew LinkedListNode<String^>( "orange" );
Console::WriteLine( "After creating the node ...." );
DisplayProperties( lln );
// Create a new LinkedList.
LinkedList<String^>^ ll = gcnew LinkedList<String^>();
// Add the "orange" node and display its properties.
ll->AddLast( lln );
Console::WriteLine( "After adding the node to the empty LinkedList ...." );
DisplayProperties( lln );
// Add nodes before and after the "orange" node and display the "orange" node's properties.
ll->AddFirst( "red" );
ll->AddLast( "yellow" );
Console::WriteLine( "After adding red and yellow ...." );
DisplayProperties( lln );
}
static void DisplayProperties( LinkedListNode<String^>^ lln ) {
if ( lln->List == nullptr )
Console::WriteLine( " Node is not linked." );
else
Console::WriteLine( " Node belongs to a linked list with {0} elements.", lln->List->Count );
if ( lln->Previous == nullptr )
Console::WriteLine( " Previous node is null." );
else
Console::WriteLine( " Value of previous node: {0}", lln->Previous->Value );
Console::WriteLine( " Value of current node: {0}", lln->Value );
if ( lln->Next == nullptr )
Console::WriteLine( " Next node is null." );
else
Console::WriteLine( " Value of next node: {0}", lln->Next->Value );
Console::WriteLine();
}
};
int main()
{
GenericCollection::Main();
}
/*
This code produces the following output.
After creating the node ....
Node is not linked.
Previous node is null.
Value of current node: orange
Next node is null.
After adding the node to the empty LinkedList ....
Node belongs to a linked list with 1 elements.
Previous node is null.
Value of current node: orange
Next node is null.
After adding red and yellow ....
Node belongs to a linked list with 3 elements.
Value of previous node: red
Value of current node: orange
Value of next node: yellow
*/
using System;
using System.Collections.Generic;
public class GenericCollection {
public static void Main() {
// Create a new LinkedListNode of type String and displays its properties.
LinkedListNode<String> lln = new LinkedListNode<String>( "orange" );
Console.WriteLine( "After creating the node ...." );
DisplayProperties( lln );
// Create a new LinkedList.
LinkedList<String> ll = new LinkedList<String>();
// Add the "orange" node and display its properties.
ll.AddLast( lln );
Console.WriteLine( "After adding the node to the empty LinkedList ...." );
DisplayProperties( lln );
// Add nodes before and after the "orange" node and display the "orange" node's properties.
ll.AddFirst( "red" );
ll.AddLast( "yellow" );
Console.WriteLine( "After adding red and yellow ...." );
DisplayProperties( lln );
}
public static void DisplayProperties( LinkedListNode<String> lln ) {
if ( lln.List == null )
Console.WriteLine( " Node is not linked." );
else
Console.WriteLine( " Node belongs to a linked list with {0} elements.", lln.List.Count );
if ( lln.Previous == null )
Console.WriteLine( " Previous node is null." );
else
Console.WriteLine( " Value of previous node: {0}", lln.Previous.Value );
Console.WriteLine( " Value of current node: {0}", lln.Value );
if ( lln.Next == null )
Console.WriteLine( " Next node is null." );
else
Console.WriteLine( " Value of next node: {0}", lln.Next.Value );
Console.WriteLine();
}
}
/*
This code produces the following output.
After creating the node ....
Node is not linked.
Previous node is null.
Value of current node: orange
Next node is null.
After adding the node to the empty LinkedList ....
Node belongs to a linked list with 1 elements.
Previous node is null.
Value of current node: orange
Next node is null.
After adding red and yellow ....
Node belongs to a linked list with 3 elements.
Value of previous node: red
Value of current node: orange
Value of next node: yellow
*/
Imports System.Collections.Generic
Public Class GenericCollection
Public Shared Sub Main()
' Create a new LinkedListNode of type String and displays its properties.
Dim lln As New LinkedListNode(Of String)("orange")
Console.WriteLine("After creating the node ....")
DisplayProperties(lln)
' Create a new LinkedList.
Dim ll As New LinkedList(Of String)
' Add the "orange" node and display its properties.
ll.AddLast(lln)
Console.WriteLine("After adding the node to the empty LinkedList ....")
DisplayProperties(lln)
' Add nodes before and after the "orange" node and display the "orange" node's properties.
ll.AddFirst("red")
ll.AddLast("yellow")
Console.WriteLine("After adding red and yellow ....")
DisplayProperties(lln)
End Sub
Public Shared Sub DisplayProperties(lln As LinkedListNode(Of String))
If lln.List Is Nothing Then
Console.WriteLine(" Node is not linked.")
Else
Console.WriteLine(" Node belongs to a linked list with {0} elements.", lln.List.Count)
End If
If lln.Previous Is Nothing Then
Console.WriteLine(" Previous node is null.")
Else
Console.WriteLine(" Value of previous node: {0}", lln.Previous.Value)
End If
Console.WriteLine(" Value of current node: {0}", lln.Value)
If lln.Next Is Nothing Then
Console.WriteLine(" Next node is null.")
Else
Console.WriteLine(" Value of next node: {0}", lln.Next.Value)
End If
Console.WriteLine()
End Sub
End Class
'This code produces the following output.
'
'After creating the node ....
' Node is not linked.
' Previous node is null.
' Value of current node: orange
' Next node is null.
'
'After adding the node to the empty LinkedList ....
' Node belongs to a linked list with 1 elements.
' Previous node is null.
' Value of current node: orange
' Next node is null.
'
'After adding red and yellow ....
' Node belongs to a linked list with 3 elements.
' Value of previous node: red
' Value of current node: orange
' Value of next node: yellow
Each element of the LinkedList<T> collection is a LinkedListNode<T>. The LinkedListNode<T> contains a value, a reference to the LinkedList<T> that it belongs to, a reference to the next node, and a reference to the previous node.
Linked |
Initializes a new instance of the LinkedListNode<T> class, containing the specified value. |
List |
Gets the LinkedList<T> that the LinkedListNode<T> belongs to. |
Next |
Gets the next node in the LinkedList<T>. |
Previous |
Gets the previous node in the LinkedList<T>. |
Value |
Gets the value contained in the node. |
Value |
Gets a reference to the value held by the node. |
Equals(Object) |
Determines whether the specified object is equal to the current object. (Inherited from Object) |
Get |
Serves as the default hash function. (Inherited from Object) |
Get |
Gets the Type of the current instance. (Inherited from Object) |
Memberwise |
Creates a shallow copy of the current Object. (Inherited from Object) |
To |
Returns a string that represents the current object. (Inherited from Object) |
Product | Versions |
---|---|
.NET | Core 1.0, Core 1.1, Core 2.0, Core 2.1, Core 2.2, Core 3.0, Core 3.1, 5, 6, 7, 8, 9 |
.NET Framework | 2.0, 3.0, 3.5, 4.0, 4.5, 4.5.1, 4.5.2, 4.6, 4.6.1, 4.6.2, 4.7, 4.7.1, 4.7.2, 4.8, 4.8.1 |
.NET Standard | 1.0, 1.1, 1.2, 1.3, 1.4, 1.6, 2.0, 2.1 |
UWP | 10.0 |
.NET feedback
.NET is an open source project. Select a link to provide feedback: