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

5 votes60 views1 answer
Printf float format
C
0 vote117 views1 answer
C change value of const
C
1 vote114 views1 answer
Using PostgreSQL array to store many-to-many relationship using sqlalchemy
C
0 vote102 views1 answer
Lldb set breakpoint function name
C
0 vote163 views1 answer
Int main() { int sum =0; FILE * ptr; ptr = fopen("d:\\students. "," "); if (ptr ==NULL){ ("file does not exist!!"); exit(0); }
C
0 vote140 views2 answers
Get last char string c
C
2 votes100 views1 answer
Terminal count files in directory
C
0 vote178 views1 answer
File "rs_to_open3d.py", line 19, in <module> point cloud = Point Cloud() NameError: name 'PointCloud' is not defined
C
2 votes130 views1 answer
How to generate a random array in c
C
0 vote109 views1 answer
Linux_reboot_magic2
C