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 votes361 views2 answers
C++ first letter of string
C++
4 votes313 views4 answers
How to get last element of set in c++
C++
0 vote314 views1 answer
C++ watch a variable
C++
0 vote335 views1 answer
C++ schleife abbrechen
C++
1 vote307 views1 answer
C++ integer array
C++
0 vote347 views1 answer
Cpp language explained
C++
7 votes293 views6 answers
Iterate through map
C++
0 vote291 views1 answer
Calculating Function codeforces in c++
C++
2 votes291 views2 answers
Count bits c++
C++
2 votes280 views1 answer
C++ check first character of string
C++