Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/dc/de1/recursive__tree__traversal_8cpp_source.html below:

TheAlgorithms/C++: others/recursive_tree_traversal.cpp Source File

recursive_tree_traversals {

std::vector<std::uint64_t>

std::vector<std::uint64_t>

std::vector<std::uint64_t>

std::vector<std::uint64_t> inorder(

std::vector<std::uint64_t>

(

->left =

->right =

;

std::vector<std::uint64_t> BT::inorder(

*root) {

(root ==

) {

BT::inorder_result.push_back(

inorder(root->right);

inorder_result;

(root ==

) {

BT::preorder_result.push_back(

preorder_result;

(root ==

) {

BT::postorder_result.push_back(

postorder_result;

deleteAll(

*

root) {

deleteAll(root->left);

deleteAll(root->right);

std::vector<std::uint64_t> actual_result_inorder{2, 7, 5, 6, 11,

std::vector<std::uint64_t> actual_result_preorder{2, 7, 2, 6, 5,

std::vector<std::uint64_t> actual_result_postorder{2, 5, 11, 6, 7,

std::vector<std::uint64_t>

std::vector<std::uint64_t>

std::vector<std::uint64_t>

std::uint64_t size = actual_result_inorder.size();

result_inorder = obj1.inorder(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_inorder[i] == result_inorder[i]);

std::cout <<

<< std::endl;

result_preorder = obj1.

(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_preorder[i] == result_preorder[i]);

std::cout <<

<< std::endl;

result_postorder = obj1.

(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_postorder[i] == result_postorder[i]);

std::cout <<

<< std::endl;

std::cout << std::endl;

std::vector<std::uint64_t> actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};

std::vector<std::uint64_t> actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};

std::vector<std::uint64_t> actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};

std::vector<std::uint64_t>

std::vector<std::uint64_t>

std::vector<std::uint64_t>

std::uint64_t size = actual_result_inorder.size();

result_inorder = obj2.inorder(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_inorder[i] == result_inorder[i]);

std::cout <<

<< std::endl;

result_preorder = obj2.

(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_preorder[i] == result_preorder[i]);

std::cout <<

<< std::endl;

result_postorder = obj2.

(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_postorder[i] == result_postorder[i]);

std::cout <<

<< std::endl;

std::cout << std::endl;

std::vector<std::uint64_t> actual_result_inorder{4, 2, 5, 1, 3};

std::vector<std::uint64_t> actual_result_preorder{1, 2, 4, 5, 3};

std::vector<std::uint64_t> actual_result_postorder{4, 5, 2, 3, 1};

std::vector<std::uint64_t>

std::vector<std::uint64_t>

std::vector<std::uint64_t>

std::uint64_t size = actual_result_inorder.size();

result_inorder = obj3.inorder(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_inorder[i] == result_inorder[i]);

std::cout <<

<< std::endl;

result_preorder = obj3.

(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_preorder[i] == result_preorder[i]);

std::cout <<

<< std::endl;

result_postorder = obj3.

(root);

std::cout <<

;

(

i = 0; i < size; ++i) {

assert(actual_result_postorder[i] == result_postorder[i]);

std::cout <<

<< std::endl;

std::cout << std::endl;

std::cout <<

<< std::endl;

std::cout <<

<< std::endl;

std::cout <<

<< std::endl;

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

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

preorder function that will perform the preorder traversal recursively, and return the resultant vect...

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

postorder function that will perform the postorder traversal recursively, and return the result vecto...

Node * createNewNode(std::uint64_t)

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

void test2()

2nd test-case

void test1()

1st test-case

static void tests()

Self-test implementations.

void test3()

3rd test-case

int main()

Main function.

The structure to hold Nodes of the tree.

std::uint64_t data

The value/key of the node.

struct Node * left

struct pointer to left subtree.

struct Node * right

struct pointer to right subtree.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4