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 votes140 views1 answer
Change plot line color in matplotlib
C
1 vote129 views2 answers
To find greatest of 4 numbers in c
C
0 vote142 views1 answer
Array type has incomplete element type struct
C
0 vote146 views1 answer
How to open form in vb.net
C
0 vote142 views2 answers
Set all pins as input for loop
C
1 vote156 views1 answer
Error: dereferencing pointer to incomplete type
C
0 vote143 views1 answer
$ei = $_GET['id']; $na = $_GET['name']; $em = $_GET['email'];
C
0 vote151 views1 answer
#![feature]` may not be used on the // stable release channel
C
10 votes144 views2 answers
Malloc c include
C
-1 vote147 views2 answers
C cree un tableau
C