C++ print binary treenode

void printBT(const std::string& prefix, const BSTNode* node, bool isLeft)
{
    if( node != nullptr )
    {
        std::cout << prefix;

        std::cout << (isLeft ? "├──" : "└──" );

        // print the value of the node
        std::cout << node->m_val << std::endl;

        // enter the next tree level - left and right branch
        printBT( prefix + (isLeft ? "│   " : "    "), node->m_left, true);
        printBT( prefix + (isLeft ? "│   " : "    "), node->m_right, false);
    }
}

void printBT(const BSTNode* node)
{
    printBT("", node, false);    
}

// pass the root node of your binary tree
printBT(root);

Source: stackoverflow.com

Similar codes

1 vote241 views1 answer
What is difference between single inverted and double inverted in programming languages
C++
0 vote253 views1 answer
Destiny child
C++
0 vote236 views1 answer
Template member functions in cpp files
C++
7 votes247 views2 answers
Count number of char in a string c++
C++
3 votes240 views2 answers
Print type c++
C++
0 vote256 views1 answer
Access first value in a set c++
C++
1 vote250 views1 answer
Comentar todas linhas de uma vez vs code
C++
0 vote243 views1 answer
Declare a tab c++
C++
0 vote254 views1 answer
How to take continuous input in c++ until any value. Like for example(taking input until giving q)
C++
1 vote260 views1 answer
Area of a Circle in C++ Programming
C++