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 vote400 views1 answer
Clarity ppm jasper domain commands
C
2 votes401 views1 answer
What are the 3 basic types of Plate Boundaries? Explain their differences (how they act).
C
2 votes380 views1 answer
How to define Max in define in c
C
0 vote390 views2 answers
How to select multiple non-consecutive words on mac
C
0 vote398 views1 answer
Como hacer para que una salida en linux aparezca de poco en poco
C
1 vote370 views1 answer
Adb switch to usb
C
1 vote371 views4 answers
Array of strings c
C
0 vote370 views1 answer
C Operator associativity
C
0 vote360 views1 answer
C/c drop mime
C
0 vote380 views1 answer
Epita
C