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 vote219 views1 answer
Calculate the area of a circle and modify the same program to calculate the volume of a cylinder given its radius and height.
C
0 vote228 views1 answer
C ausgabe
C
0 vote214 views1 answer
Leggere stringhe con spazio in mezzo c
C
1 vote223 views1 answer
Load and display figure in python
C
2 votes245 views1 answer
Curl cpp
C
0 vote213 views1 answer
How to declare 3dimensional arrays in wiring
C
0 vote218 views2 answers
#0000ff
C
26 votes254 views5 answers
Zsh: command not found: brew
C
0 vote232 views1 answer
WAP to create Database using array of structure & display it in C
C
1 vote230 views1 answer
Print float number completely in C language
C