左神算法书籍《程序员代码面试指南》——2_12将搜索二叉树转换成双向链表【★★】

 1 class PrintTree
 2 {
 3 public:
 4     void Print(Node* root)
 5     {
 6         cout << "The shape of tree is: " << endl;
 7         cout << "=============================================================" << endl;
 8         PrintShape(root, 0, "H", 17);
 9         cout << "=============================================================" << endl;
10     }
11     void PrintShape(Node* root, int h, string c, int len)
12     {
13         if (root)
14         {
15             PrintShape(root->rchild, h + 1, "v", len);
16             string val;
17             stringstream ss;
18             ss << root->val;
19             ss >> val;
20             val = c + val + c;
21             int lenM = val.length();
22             int lenL = (len - lenM) / 2;
23             int lenR = len - lenM - lenL;
24             val = getSpace(lenL) + val + getSpace(lenR);
25             cout << getSpace(h*len) + val << endl;
26             PrintShape(root->lchild, h + 1, "^", len);
27         }
28 
29     }
30     string getSpace(int num)
31     {
32         string space = " ";
33         for (int i = 0; i < num; ++i)
34             space.append(" ");
35         return space;
36     }
37 };