Scribd Logo
Upload

Welcome to Scribd!

  • BST Complexity

    Uploaded by

    Abdiel Alvin
    4 views1 page
    This document outlines the time complexities of common operations on binary search trees (BST). It shows that insertion, search, and deletion have average and best case complexities of O(log n) but worst case of O(n), while space requirements are O(n).

    Original Description:

    BST Complexity definition

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the time complexities of common operations on binary search trees (BST). It shows that insertion, search, and deletion have average and best case complexities of O(log n) but worst case of O(n), while space requirements are O(n).

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    BST Complexity

    Uploaded by

    Abdiel Alvin
    This document outlines the time complexities of common operations on binary search trees (BST). It shows that insertion, search, and deletion have average and best case complexities of O(log n) but worst case of O(n), while space requirements are O(n).

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    BST

    Space
    Insert
    Search
    Delete

    Best Case
    O(n)
    O(log n)
    O(log n)
    O(log n)

    Average Case
    O(n)
    O(log n)
    O(log n)
    O(log n)

    Worst Case
    O(n)
    O(n)
    O(n)
    O(n)

    You might also like