BST的后序遍历_bst后序遍历

/*
    24:> BST的后序遍历
*/
bool judge(int ar[], int len)
{
    if (ar == NULL || len <= 0)
        return false;

    int root = ar[len - 1];

    int i = 0;
    for (; i < len-1; ++i)
        if(ar[i]>root)
            break;

    int j = i;
    for (; j < len - 1; ++j)
        if (ar[j] < root)
            return false;

    bool left = true;
    if (i > 0)
        left = judge(ar, i);

    bool right = true;
    if (i < len - 1)
        right = judge(ar + i, len - i-1);

    return left && right;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30