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 vote543 views1 answer
Code: 'EADDRINUSE', [0] errno: 'EADDRINUSE', [0] syscall: 'listen', [0] address: '::', [0] port: 5000
C
4 votes230 views2 answers
Maximo comun divisor
C
2 votes240 views2 answers
Json reading in php with key
C
0 vote217 views6 answers
C++ to c converter online
C
0 vote233 views1 answer
OpenDaylight maven settings
C
1 vote288 views1 answer
Length of string in c
C
0 vote225 views1 answer
Imprimir matriz
C
0 vote247 views1 answer
A program that reads words from a text file and displays all words in ascending alphabetical order
C
0 vote233 views1 answer
Difference between signed apk and unsigned apk
C
0 vote248 views1 answer
Get configuration script window 7
C