Breaking News: Grepper is joining You.com. Read the official announcement!

BSTNode root

Ashamed Anteater answered on December 24, 2021 Popularity 6/10 Helpfulness 1/10

answer BSTNode root

BSTNode root

Comment

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
}

Popularity 6/10 Helpfulness 1/10 Language c

Source: afteracademy.com

Tags: c root

Link to this answer
Share Copy Link

Contributed on Dec 24 2021

Ashamed Anteater

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

BSTNode root

Contents

More Related Answers

BSTNode root

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.