BSTNode root

void storeInorder(BSTNode root, int arr[])
{
    if (root == NULL)
        return
    storeInorder(root.left, arr)
    arr.append(root.val)
    storeInorder(root.right, arr)
}
boolean isBST(BSTNode root)
{
    int arr[]   // Auxiliary array to store inorder 
    storeInorder(root, arr) // Traverses the array in inorder fashion and stores the result in arr
    // Lets check if arr is in sorted order or not
    for(i = 1 to arr.length - 1)
        if (arr[i] < arr[i-1])
            return False 
    return True
}

Source: afteracademy.com

Similar codes

5 votes188 views4 answers
Div same line
C
0 vote163 views1 answer
Retoure a la ligne C
C
6 votes162 views2 answers
How to download file in powershell
C
-1 vote161 views1 answer
Plt hide axis ticks
C
0 vote220 views2 answers
String array input in c
C
7 votes94 views2 answers
Install c compiler ubuntu
C
-3 votes161 views1 answer
Uri/beecrowd problem no - 1133 solution in C
C
0 vote148 views2 answers
Print %% in c
C
0 vote174 views1 answer
Parcel-builder put image in sub folder
C
0 vote158 views1 answer
Get range of values in mongodb
C