Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void SecondTree::printBT(string sp, string sn, Node * v)
- {
- string cr,cl,cp;
- cr = cl = cp = " ";
- cr[0] = 218; cr[1] = 196;
- cl[0] = 192; cl[1] = 196;
- cp[0] = 179;
- string s;
- if(v)
- {
- s = sp;
- if(sn == cr) s[s.length() - 2] = ' ';
- printBT(s + cp, cr, v->right);
- s = s.substr(0,sp.length()-2);
- cout << s << sn << v->key << ":" << v->balance << endl;
- s = sp;
- if(sn == cl) s[s.length() - 2] = ' ';
- printBT(s + cp, cl, v->left);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement