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 vote131 views1 answer
Check command line input is a number in c
C
0 vote170 views5 answers
Online c compiler with mpi
C
0 vote125 views3 answers
Chevront de vlavier
C
0 vote174 views1 answer
Get range of values in mongodb
C
1 vote143 views1 answer
'&&' within '||'
C
0 vote135 views1 answer
Socket only connection
C
0 vote135 views2 answers
233 pounds to inr
C
0 vote136 views1 answer
Iterating through a linked list
C
1 vote136 views1 answer
Accessing elements of 1d array using pointers
C
0 vote124 views1 answer
Oracle trunc
C