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

1 vote261 views4 answers
Convert preorder to postorder calculator
C++
-1 vote313 views1 answer
Intersection between vector c++
C++
0 vote286 views1 answer
C++ abs template
C++
1 vote271 views1 answer
Detect cycle in an undirected graph
C++
0 vote280 views1 answer
Return the index where maximum element in a vector
C++
0 vote295 views1 answer
Check whether kth bit is 1
C++
1 vote283 views1 answer
Add on screen debug message ue4
C++
0 vote272 views1 answer
3 conditions for a while loop c++
C++
0 vote293 views1 answer
Cpp concatenate methods
C++
0 vote282 views1 answer
C++ drop last element of list
C++