node< Kind > Class Template Reference

for std::vector More...

#include <queue.h>

Collaboration diagram for node< Kind >:

Public Member Functions
	node (int d)

Public Attributes
int	data
int	height
struct node *	left
struct node *	right
int	val
node *	left
node *	right
struct node *	next
node *	next
node *	prev
Kind	data
node< Kind > *	next
int	key
node *	parent
char	color
ValueType	data = {}
	data at current node
std::shared_ptr< node< ValueType > >	next
	pointer to the next node instance
node *	link

Detailed Description

template<class Kind>
class node< Kind >

for std::vector

Definition of the node

for IO operations for std::shared_ptr for std::invalid_argument Definition of the node as a linked-list

Template Parameters

ValueType

type of data nodes of the linked list should contain

Constructor & Destructor Documentation

node()

template<class Kind >

node< Kind >::node ( int  d )

inline

                {
        data = d;
        link = NULL;
    }

Member Data Documentation

next

template<class Kind >

std::shared_ptr<node<ValueType> > node< Kind >::next

Initial value:

=
        {}

pointer to the next node instance

---

The documentation for this class was generated from the following files:

• data_structures/avltree.cpp
• data_structures/binary_search_tree.cpp
• data_structures/circular_queue_using_linked_list.cpp
• data_structures/cll/cll.h
• data_structures/doubly_linked_list.cpp
• data_structures/queue.h
• data_structures/queue_using_linked_list.cpp
• data_structures/rb_tree.cpp
• data_structures/stack.hpp
• data_structures/stack_using_linked_list.cpp
• data_structures/tree.cpp
• operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp
• operations_on_datastructures/selectionsortlinkedlist.cpp