BT used to make the entire structure of the binary tree and the functions associated with the binary tree. More...

Collaboration diagram for others::recursive_tree_traversals::BT:

Public Member Functions
Node *	createNewNode (std::uint64_t)
	will allocate the memory for a node and, along the data and return the node.

std::vector< std::uint64_t >	inorder (Node *)

std::vector< std::uint64_t >	preorder (Node *)
	preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree.

std::vector< std::uint64_t >	postorder (Node *)
	postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree.

Public Attributes
std::vector< std::uint64_t >	inorder_result

std::vector< std::uint64_t >	preorder_result

std::vector< std::uint64_t >	postorder_result

Detailed Description

BT used to make the entire structure of the binary tree and the functions associated with the binary tree.

Definition at line 88 of file recursive_tree_traversal.cpp.

Member Function Documentation

◆ createNewNode()

Node * others::recursive_tree_traversals::BT::createNewNode ( std::uint64_t data )

will allocate the memory for a node and, along the data and return the node.

Parameters

data	value that a particular node will contain.

Returns: pointer to the newly created node with assigned data.

Definition at line 118 of file recursive_tree_traversal.cpp.

                                        {
    Node *node = new Node();
    node->data = data;
    node->left = node->right = nullptr;
    return node;
}

◆ inorder()

std::vector< std::uint64_t > others::recursive_tree_traversals::BT::inorder ( Node * root )

Definition at line 132 of file recursive_tree_traversal.cpp.

                                             {
    if (root == nullptr) {  // return if the current node is empty
        return {};
    }
 
    inorder(root->left);  // Traverse the left subtree
    BT::inorder_result.push_back(
        root->data);  // Display the data part of the root (or current node)
    inorder(root->right);  // Traverse the right subtree
 
    return inorder_result;
}

◆ postorder()

std::vector< std::uint64_t > others::recursive_tree_traversals::BT::postorder ( Node * root )

postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree.

Parameters

root	head/root node of a tree

Returns: result that is containing the postorder traversal of a tree

Definition at line 172 of file recursive_tree_traversal.cpp.

                                               {
    if (root == nullptr) {  // if the current node is empty
        return {};
    }
 
    postorder(root->left);   // Traverse the left subtree
    postorder(root->right);  // Traverse the right subtree
    BT::postorder_result.push_back(
        root->data);  // Display the data part of the root (or current node)
 
    return postorder_result;
}

◆ preorder()

std::vector< std::uint64_t > others::recursive_tree_traversals::BT::preorder ( Node * root )

preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree.

Parameters

root	head/root node of a tree

Returns: result that is containing the preorder traversal of a tree

Definition at line 152 of file recursive_tree_traversal.cpp.

                                              {
    if (root == nullptr) {  // if the current node is empty
        return {};
    }
 
    BT::preorder_result.push_back(
        root->data);  // Display the data part of the root (or current node)
    preorder(root->left);   // Traverse the left subtree
    preorder(root->right);  // Traverse the right subtree
 
    return preorder_result;
}