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

8 votes178 views1 answer
Run time in c
C
1 vote194 views1 answer
Length of string in c
C
0 vote165 views1 answer
Fine print serial key
C
0 vote121 views1 answer
Fina students name by using html backend database
C
0 vote180 views1 answer
WARNING: QA Issue: bgslibrary-dev rdepends on libopencv-imgproc, but it isn't a build dependency, missing opencv in DEPENDS or PACKAGECONFIG? [build-deps]
C
29 votes243 views1 answer
C challenge
C
3 votes181 views2 answers
Strcpy
C
1 vote175 views1 answer
Divide and conquer program in c
C
0 vote160 views1 answer
Iulia vântur
C
0 vote241 views1 answer
Best graphic video template for editing free download
C