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 vote216 views2 answers
Create role in psql with password
C
4 votes191 views2 answers
No module names skimage
C
2 votes198 views1 answer
Unity 2d movement and animation
C
0 vote339 views1 answer
How to link flexslider
C
0 vote197 views1 answer
What's the difference between "call" and "invoke"?
C
5 votes214 views1 answer
Https://www.codegrepper.com/search.php?q=convert%20string%20to%20float%20c
C
-1 vote218 views1 answer
C check if file was created
C
2 votes179 views2 answers
Prototype pollution
C
0 vote197 views1 answer
Mark rober
C
2 votes157 views1 answer
Vscode arduino [Warning] Output path is not specified. Unable to reuse previously compiled files. Upload could be slow. See README.
C