直观打印二叉树的图形

直观打印一个二叉树的图形,记得把顺时针旋转90度来看
附上 java /c++ 诚意满满

// Java版 
public class PrintBinaryTree {

    public static class Node {
        public int value;
        public Node left;
        public Node right;

        public Node(int data) {
            this.value = data;
        }
    }
    public static void printTree(Node head) {
        System.out.println("Binary Tree:");
        printInOrder(head, 0, "H", 17);
        System.out.println();
    }
    public static void printInOrder(Node head, int height, String to, int len) {
        if (head == null) {
            return;
        }
        printInOrder(head.right, height + 1, "v", len);
        String val = to + head.value + to;
        int lenM = val.length();
        int lenL = (len - lenM) / 2;
        int lenR = len - lenM - lenL;
        val = getSpace(lenL) + val + getSpace(lenR);
        System.out.println(getSpace(height * len) + val);
        printInOrder(head.left, height + 1, "^", len);
    }
    public static String getSpace(int num) {
        String space = " ";
        StringBuffer buf = new StringBuffer("");
        for (int i = 0; i < num; i++) {
            buf.append(space);
        }
        return buf.toString();
    }
    public static void main(String[] args) {
        head = new Node(1);
        head.left = new Node(2);
        head.right = new Node(3);
        head.left.left = new Node(4);
        head.right.left = new Node(5);
        head.right.right = new Node(6);
        head.left.left.right = new Node(7);
        printTree(head);

        head = new Node(1);
        head.left = new Node(1);
        head.right = new Node(1);
        head.left.left = new Node(1);
        head.right.left = new Node(1);
        head.right.right = new Node(1);
        head.left.left.right = new Node(1);
        printTree(head);

    }

}

//c++版
typedef  struct Node {
    int value;
    Node* left;
    Node* right;
} Node;
string getSpace(int num) {
    string space = " ";
    string buf = "";
    for (int i = 0; i < num; i++) {
        buf.append(space);
    }
    return buf;
}
void printInOrder(Node* head, int height, string to, int len) {
    if (head == nullptr) {
        return;
    }
    printInOrder(head->right, height + 1, "v", len);
    string val = to ;
    val += to_string(head->value);
    val += to;
    int lenM = (int)val.length();
    int lenL = (len - lenM) / 2;
    int lenR = len - lenM - lenL;
    val = getSpace(lenL) + val + getSpace(lenR);
    cout<<getSpace(height * len) + val<<endl;
    printInOrder(head->left, height + 1, "^", len);
}

 void printTree(Node* head) {
     cout<<"Binary Tree:";
     printInOrder(head, 0, "H", 17);
     cout<< endl;
 }
int  main() {
    Node head  = {.value = 0};
    Node head1 = {.value = 1};
    Node head2 = {.value = 2};
    Node head3 = {.value = 3};
    Node head4 = {.value = 4};
    Node head5 = {.value = 5};
    Node head6 = {.value = 6};
    Node head7 = {.value = 7};

    head.left = &head1;
    head.right = &head2;
    head.left->left = &head3;
    head.right->left = &head4;
    head.right->right = &head5;
    head.left->left->right = &head6;
    head.left->left->left  = &head7;
    printTree(&head);
}