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

0 vote139 views1 answer
C question mark
C
16 votes140 views6 answers
Golang map
C
0 vote160 views1 answer
Lazer codechef
C
0 vote137 views1 answer
Remplir list Java rapidemnet
C
0 vote140 views1 answer
Time random c
C
0 vote180 views2 answers
Get last char string c
C
0 vote136 views1 answer
Or gmode inline image
C
0 vote160 views1 answer
Imprimir matriz
C
0 vote81 views1 answer
Turn on and turn off different device at the same time in rainmaker
C
0 vote128 views1 answer
How to set string to null in c
C