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 vote169 views1 answer
Djb2 algorithm for C
C
-1 vote188 views1 answer
C pause for 1 second
C
0 vote201 views1 answer
How to italicise the text in html
C
0 vote171 views1 answer
Flip exis in dataframe
C
0 vote173 views1 answer
C read a whole string from a file
C
0 vote181 views1 answer
C percentage program
C
0 vote216 views1 answer
Eeprom read arduinojson object
C
2 votes185 views5 answers
Arduino internal pull up resistor
C
0 vote189 views1 answer
Xor in c
C
0 vote188 views2 answers
How to debug a segmentation fault in c
C