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

12 votes172 views1 answer
How to sort in descending order c++
C++
0 vote175 views1 answer
For auto map C
C++
0 vote179 views1 answer
Inverted triangle c++
C++
0 vote180 views1 answer
How to store array of string with spaces in c++ stl
C++
0 vote222 views1 answer
Codeforces Pangram in c++
C++
5 votes140 views4 answers
Memset function c++
C++
0 vote181 views1 answer
Uint8_t in c++
C++
0 vote175 views1 answer
C++ fill array with 0
C++
0 vote196 views1 answer
What is "\0" character in c++
C++
0 vote189 views1 answer
Write a C++ program to Computing Mean and Median Using Arrays
C++