Scribd Logo
Upload

Welcome to Scribd!

  • Prepared By, J. K. Josephine Julina

    Uploaded by

    SHYAM
    11 views1 page
    The document provides instructions for a C++ program to implement operations on a binary search tree (BST) including building the tree, inserting nodes, searching, deleting nodes, finding minimum and maximum elements, and traversing the tree in inorder, preorder, and postorder. The operations are buildtree(), insert(), search(), delete(), findmin(), findmax(), inordertraverse(), preordertraverse(), and postordertraverse().

    Original Description:

    Original Title

    Untitled

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides instructions for a C++ program to implement operations on a binary search tree (BST) including building the tree, inserting nodes, searching, deleting nodes, finding minimum and maximum elements, and traversing the tree in inorder, preorder, and postorder. The operations are buildtree(), insert(), search(), delete(), findmin(), findmax(), inordertraverse(), preordertraverse(), and postordertraverse().

    Copyright:

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

    Prepared By, J. K. Josephine Julina

    Uploaded by

    SHYAM
    The document provides instructions for a C++ program to implement operations on a binary search tree (BST) including building the tree, inserting nodes, searching, deleting nodes, finding minimum and maximum elements, and traversing the tree in inorder, preorder, and postorder. The operations are buildtree(), insert(), search(), delete(), findmin(), findmax(), inordertraverse(), preordertraverse(), and postordertraverse().

    Copyright:

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

    SSN COLLEGE OF ENGINEERING, KALAVAKKAM – 603 110

    DEPARTMENT OF INFORMATION TECHNOLOGY

    13. Write a C++ program to implement Binary search tree ADT operations and
    perform Tree Traversals.
    Operations
    Buildtree() – Initializes the Binary Search tree(BST)
    Insert() – insert a new node into a BST
    Search() – finds a node in BST
    Delete() – removes a node from the BST
    Findmin() – returns the minimum element in the BST
    Findmax() - returns the maximum element in the BST
    InorderTraverse() – traverse the BST in Inorder
    PreorderTraverse() – traverse the BST in Preorder
    PostorderTraverse() – traverse the BST in Postorder

    Prepared by,
    J. K. Josephine Julina

    You might also like