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

2 votes307 views1 answer
How to include math library in c
C
0 vote321 views1 answer
Check if pid exists c
C
0 vote351 views1 answer
Lcm of 2 numbers in c
C
0 vote344 views1 answer
Program to check whether the number is prime or not in java
C
0 vote330 views1 answer
Semicolong after for() loop stackoverflow
C
0 vote346 views1 answer
Houdini vex loop over points
C
0 vote314 views1 answer
How to transform a char to ascii code in c
C
0 vote330 views1 answer
Gdebi install with yes option
C
0 vote327 views1 answer
Printing out 2 strings in c
C
0 vote330 views3 answers
Confirm sweet alert
C