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 votes319 views2 answers
Curl authorization header
C
0 vote313 views1 answer
Strlen stop before '\0' or at
C
1 vote318 views1 answer
Where can you use Greater than or equal to in C
C
1 vote318 views1 answer
Como programar a area de um triangulo em c
C
1 vote326 views1 answer
What is covert channel
C
0 vote322 views1 answer
Konami code hdl
C
0 vote318 views1 answer
Definir função em c
C
0 vote295 views1 answer
Logical Operator in C language
C
-2 votes295 views1 answer
Remove c
C
0 vote313 views1 answer
Unpack and repack deb package
C