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 vote179 views1 answer
Find Subarray sum using c++
C++
3 votes230 views2 answers
Find maximum sum in array of contiguous subarrays
C++
1 vote193 views3 answers
Google snake game
C++
0 vote195 views1 answer
The smallest element from three
C++
4 votes187 views1 answer
How to make i/o fast in c++
C++
0 vote197 views1 answer
Phi function (n log (log(n)))
C++
0 vote205 views1 answer
Get thread id c++
C++
0 vote194 views1 answer
Use textchanged qt cpp
C++
1 vote189 views1 answer
Eosio parse string
C++
0 vote182 views1 answer
Temporary mobile number
C++