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 votes118 views3 answers
Quick sort c++
C++
1 vote124 views1 answer
How to make sure the user inputs a int and not anything else c++
C++
0 vote100 views1 answer
How to find the left most bit 1 in binary of any number
C++
0 vote107 views1 answer
MPI_Sendrecv
C++
1 vote101 views1 answer
How to ensure the user inouts a int and not anything else c++
C++
4 votes97 views1 answer
Clear file before writing c++
C++
0 vote105 views1 answer
How to show constellations in starry night orion special edition
C++
1 vote98 views1 answer
C++ check open processes
C++
30 votes98 views2 answers
Integer range in c++
C++
0 vote102 views1 answer
Clear qlayout
C++