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

1 vote201 views1 answer
Grepper vscodium
C
0 vote188 views1 answer
Printing out 2 strings in c
C
0 vote255 views1 answer
Gemfile.lock`. It is likely that you need to grant write permissions for that path.
C
0 vote198 views1 answer
YOUNG SEX PARTY underground collection
C
0 vote203 views1 answer
How to get add to number C
C
0 vote197 views2 answers
Greatest common divisor iterative
C
-1 vote164 views1 answer
Sadsa
C
7 votes196 views1 answer
Invalid operands to binary expression ('int *' and 'int *')
C
1 vote212 views4 answers
V
C
0 vote200 views1 answer
Desktop
C