TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
Loading...
Searching...
No Matches
operations_on_datastructures::inorder_traversal_of_bst::Node Class Reference

A Node structure representing a single node in BST. More...

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

Public Attributes

int64_t data
 The key/value of the node.
 
Nodeleft
 Pointer to Left child.
 
Noderight
 Pointer to right child.
 

Detailed Description

A Node structure representing a single node in BST.

Definition at line 56 of file inorder_successor_of_bst.cpp.

Member Data Documentation

◆ data

int64_t operations_on_datastructures::inorder_traversal_of_bst::Node::data

The key/value of the node.

Definition at line 58 of file inorder_successor_of_bst.cpp.

◆ left

Node* operations_on_datastructures::inorder_traversal_of_bst::Node::left

Pointer to Left child.

Definition at line 59 of file inorder_successor_of_bst.cpp.

◆ right

Node* operations_on_datastructures::inorder_traversal_of_bst::Node::right

Pointer to right child.

Definition at line 60 of file inorder_successor_of_bst.cpp.


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