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

4 votes327 views1 answer
C double specifier
C
0 vote351 views1 answer
Bcd to char c
C
0 vote309 views1 answer
Count number of vowels in a string in c
C
0 vote313 views1 answer
How to find folders from a c program
C
0 vote292 views1 answer
Fgets langage c
C
0 vote310 views2 answers
Struct main function c in unix
C
0 vote310 views1 answer
Execute maven project in cmd
C
0 vote314 views1 answer
Refresh a chromebook terminal
C
0 vote351 views1 answer
Tkinter create_line
C
8 votes428 views3 answers
Casting in c
C