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 vote143 views1 answer
Buble sort in c that ask user input
C
0 vote160 views1 answer
How to stop scanf from adding a new line in c
C
1 vote138 views1 answer
C constructor
C
0 vote152 views2 answers
Mongo connect db
C
-1 vote111 views1 answer
Sadsa
C
0 vote156 views1 answer
UTC offset upper limit
C
0 vote151 views1 answer
Printf("%3d ",XX);
C
0 vote157 views1 answer
Graphics in C Draw A Line
C
4 votes157 views1 answer
Best switch game
C
0 vote147 views2 answers
Declare variables arduino
C