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

5 votes212 views2 answers
C macros
C
0 vote197 views1 answer
Mac quick-look
C
5 votes195 views2 answers
C malloc array
C
0 vote202 views1 answer
Q2. wap in c to input 5 numbers in an array and display in reverse order.
C
0 vote216 views1 answer
Google sheets transpose new line to table
C
0 vote212 views1 answer
What happens if i acess a freed variable in c
C
4 votes231 views1 answer
How to print value of pointer in c
C
0 vote151 views1 answer
What is stdin fd number
C
0 vote221 views1 answer
C defined value sum
C
0 vote205 views2 answers
How to select multiple non-consecutive words on mac
C