clockwise print binary search tree

给一个二叉树, 顺时针打印出所有的节点, 例如:

应该打印: 20, 8, 4, 10, 14, 25, 22

思路: 可以分为三步打印:

1. 打印左边界, 最后一个叶子节点不打印

2. 打印所有叶子结点

3. 打印右边界, 根和最后一个叶子结点不打印

代码如下:

    void printLeft(TreeNode* root){
        if(!root) return;
        if(root->left || root->right) cout << root->val << " ";
        if(root->left) printLeft(root->left);
        else printLeft(root->right);
    }
    
    void printLeaf(TreeNode* root){
        if(!root) return;
        printLeaf(root->left);
        if(!root->left && !root->right) cout << root->val << " ";
        printLeaf(root->right);
    }
    
    void printRight(TreeNode* root){
        if(!root) return;
        if(root->right) printRight(root->right);
        else printRight(root->left);
        if(root->left || root->right) cout << root->val << " ";
    }
    
    void clockwisePrintTree(TreeNode* root){
        if(!root) return;
        printLeft(root);
        printLeaf(root);
        printRight(root->right);
    }