delete-the-middle-node-of-a-linked-list 1.0.0
Delete the Middle Node of a Linked List
Loading...
Searching...
No Matches
Public Member Functions | Data Fields
ListNode Struct Reference

Definition for singly-linked list. More...

Collaboration diagram for ListNode:
Collaboration graph
[legend]

Public Member Functions

 ListNode ()
 
 ListNode (int x)
 
 ListNode (int x, ListNode *next)
 

Data Fields

int val
 
ListNode * next
 

Detailed Description

Definition for singly-linked list.

Definition at line 8 of file main.cpp.

Constructor & Destructor Documentation

◆ ListNode() [1/3]

ListNode::ListNode ( )
inline

Definition at line 12 of file main.cpp.

12: val(0), next(nullptr) {}
ListNode::val
int val
Definition main.cpp:10
ListNode::next
ListNode * next
Definition main.cpp:11

◆ ListNode() [2/3]

ListNode::ListNode ( int  x)
inline

Definition at line 13 of file main.cpp.

13: val(x), next(nullptr) {}

◆ ListNode() [3/3]

ListNode::ListNode ( int  x,
ListNode *  next 
)
inline

Definition at line 14 of file main.cpp.

14: val(x), next(next) {}

Field Documentation

◆ next

ListNode* ListNode::next

Definition at line 11 of file main.cpp.

Referenced by Solution::deleteMiddle().

◆ val

int ListNode::val

Definition at line 10 of file main.cpp.

The documentation for this struct was generated from the following file: