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 vote213 views1 answer
Futter Square Button
C
-1 vote199 views1 answer
Queryfailederror: invalid input syntax for type uuid:
C
33 votes249 views10 answers
Chat
C
1 vote197 views1 answer
Como programar a area de um triangulo em c
C
13 votes199 views5 answers
Pandas index
C
0 vote214 views1 answer
Parcel-builder put image in sub folder
C
0 vote196 views1 answer
Command to perform safe shutdown in unix
C
45 votes187 views3 answers
String concatenation in c
C
2 votes196 views1 answer
Can we write a program without main in c
C
1 vote151 views1 answer
What is "," in programming syntax
C