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

1 vote311 views1 answer
Is it possible to access argv in function
C
0 vote375 views1 answer
Undefined reference to `cv::VideoCapture::VideoCapture(cv::String const&)'
C
18 votes284 views6 answers
How to check disk space in linux
C
1 vote273 views1 answer
How to install vscode extension manually
C
0 vote321 views1 answer
C for schleife
C
47 votes421 views4 answers
Brainfuck programming language
C
0 vote336 views2 answers
Time to apply pmfby
C
0 vote306 views1 answer
C change value of const
C
1 vote300 views2 answers
C printf float value
C
13 votes312 views4 answers
Remove anaconda completely ubuntu
C