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 votes322 views1 answer
Printf signed char
C
1 vote273 views1 answer
What is "," in programming syntax
C
0 vote291 views1 answer
Lldb set breakpoint function name
C
1 vote309 views1 answer
How to use gets after scanf
C
1 vote327 views3 answers
How to prevent user from entering char when needing int in c
C
0 vote292 views1 answer
Entity framework core discard changes
C
5 votes294 views2 answers
C malloc array
C
4 votes306 views1 answer
What is ide?
C
0 vote313 views1 answer
C string equil
C
0 vote347 views1 answer
Stdin char c
C