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 vote206 views1 answer
Fibonacci program c pthread
C
24 votes236 views3 answers
Filing in C
C
0 vote197 views1 answer
Len of str vbs
C
1 vote234 views1 answer
How to know ip address of my pc
C
1 vote208 views2 answers
Sdl draw Rectf
C
0 vote240 views1 answer
Parcel-builder put image in sub folder
C
0 vote198 views1 answer
$ei = $_GET['id']; $na = $_GET['name']; $em = $_GET['email'];
C
0 vote189 views2 answers
Compil cywin cgi
C
0 vote200 views1 answer
C include delay
C
0 vote276 views1 answer
C program for airthmetic operators
C