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 vote240 views1 answer
Series sort values
C
0 vote262 views1 answer
Docker-compose file break line
C
0 vote266 views1 answer
Arduino uno spi pins
C
1 vote271 views1 answer
Rounding decimal number in C
C
3 votes261 views1 answer
How make a character in c scanf
C
2 votes249 views1 answer
Unity 2d movement and animation
C
33 votes328 views2 answers
Latex font sizes
C
2 votes237 views2 answers
Linux directory commands
C
0 vote243 views1 answer
Python adding calculator
C
0 vote249 views1 answer
C atoi atof
C