Collaboration diagram for node:

[legend]

Public Member Functions
	node (int d)

Public Attributes
int	val
node *	left
node *	right
int	data
struct node *	next
node *	next
node *	prev
int	key
node *	parent
char	color
node *	link

Detailed Description

Definition at line 11 of file binary_search_tree.cpp.

Constructor & Destructor Documentation

◆ node()

node::node ( int d )

inline

Definition at line 9 of file selectionsortlinkedlist.cpp.

                {
        data = d;
        link = NULL;
    }

Member Data Documentation

◆ color

char node::color

Definition at line 9 of file rb_tree.cpp.

◆ data

int node::data

Definition at line 4 of file circular_queue_using_linked_list.cpp.

◆ key

int node::key

Definition at line 7 of file rb_tree.cpp.

◆ left

node * node::left

Definition at line 13 of file binary_search_tree.cpp.

◆ link

node* node::link

Definition at line 8 of file selectionsortlinkedlist.cpp.

◆ next [1/2]

node * node::next

Definition at line 5 of file circular_queue_using_linked_list.cpp.

◆ next [2/2]

node* node::next

Definition at line 14 of file cll.h.

◆ parent

node* node::parent

Definition at line 8 of file rb_tree.cpp.

◆ prev

node* node::prev

Definition at line 7 of file doubly_linked_list.cpp.

◆ right

node * node::right

Definition at line 14 of file binary_search_tree.cpp.

◆ val

int node::val

Definition at line 12 of file binary_search_tree.cpp.

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

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_using_linked_list.cpp
data_structures/rb_tree.cpp
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

Public Member Functions

Public Attributes