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

0 vote231 views1 answer
How-to-read-until-eof-from-cin-in-c++
C++
1 vote222 views1 answer
Sort array using inbuilt sort function in decreasing order
C++
0 vote215 views1 answer
Bits/stdc++.h in c++
C++
1 vote212 views1 answer
Push front vector cpp
C++
0 vote238 views1 answer
Texorpdfstring math in title latex
C++
0 vote217 views1 answer
How to scan array in c++
C++
0 vote197 views1 answer
How to use and in c++
C++
42 votes221 views10 answers
Twitter
C++
0 vote213 views1 answer
Program To Calculate Number Power Using Recursion In C++. The power number should always be positive integer.
C++
0 vote215 views1 answer
Processing a string- CodeChef Solution in CPP
C++