Algorithms_in_C++ 1.0.0
Set of algorithms implemented in C++.
Loading...
Searching...
No Matches
operations_on_datastructures::circular_linked_list::Node Struct Reference

A Node struct that represents a single Node in a Binary Tree. More...

Collaboration diagram for operations_on_datastructures::circular_linked_list::Node:
[legend]

Public Member Functions

 Node (int64_t _data)
 Creates a new Node with some initial data.
 
 Node (int64_t _data, Node *_next)
 Creates a new Node with initial data and a successor.
 

Public Attributes

int64_t data
 The value of the Node.
 
Nodenext
 The Node's successor.
 

Detailed Description

A Node struct that represents a single Node in a Binary Tree.

Constructor & Destructor Documentation

◆ Node() [1/2]

operations_on_datastructures::circular_linked_list::Node::Node ( int64_t _data)
inlineexplicit

Creates a new Node with some initial data.

Parameters
_dataValue of Node

< Set value of Node data

< Initialize successor

39 {
40 data = _data; ///< Set value of Node data
41 next = nullptr; ///< Initialize successor
42 }
int64_t data
The value of the Node.
Definition circular_linked_list.cpp:33
Node * next
The Node's successor.
Definition circular_linked_list.cpp:34

◆ Node() [2/2]

operations_on_datastructures::circular_linked_list::Node::Node ( int64_t _data,
Node * _next )
inlineexplicit

Creates a new Node with initial data and a successor.

Parameters
_dataValue of Node
_nextPointer to the next Node

< Set value of Node data

< Initialize successor

48 {
49 data = _data; ///< Set value of Node data
50 next = _next; ///< Initialize successor
51 }

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