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

3 votes135 views1 answer
Cpp boilerplate
C++
0 vote131 views1 answer
How to write a conclusion statement for an informative essay
C++
19 votes134 views2 answers
C++ rewrite file
C++
0 vote152 views1 answer
Sfml time set
C++
0 vote147 views1 answer
If not c++
C++
0 vote134 views1 answer
How to make a number always positive in c++
C++
1 vote138 views1 answer
Name one example of a “decider” program that you regularly encounter in real life.
C++
2 votes98 views1 answer
First missing integer leetcode
C++
4 votes140 views2 answers
Max value of double c++
C++
3 votes152 views10 answers
1+1
C++