Scribd Logo
Upload

Welcome to Scribd!

  • BST

    Uploaded by

    Saorabh Kumar
    5 views1 page
    The successor of a node n in a binary search tree is the node with the smallest value that is greater than n's value. The predecessor of a node n is the node with the greatest value that is smaller than n's value. A node's successor and predecessor are defined relative to its position in a binary search tree.

    Original Description:

    Original Title

    bst

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The successor of a node n in a binary search tree is the node with the smallest value that is greater than n's value. The predecessor of a node n is the node with the greatest value that is smaller than n's value. A node's successor and predecessor are defined relative to its position in a binary search tree.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views1 page

    BST

    Uploaded by

    Saorabh Kumar
    The successor of a node n in a binary search tree is the node with the smallest value that is greater than n's value. The predecessor of a node n is the node with the greatest value that is smaller than n's value. A node's successor and predecessor are defined relative to its position in a binary search tree.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    the successor of the node n is the node with smallest value that is greater than the value of n.

    the predecessor of the node n is the node with greatest value that is smaller th an the value of n.

    You might also like