Scribd Logo
Upload

Welcome to Scribd!

  • Lab 9

    Uploaded by

    Naveenjot Kaur
    7 views1 page
    This document outlines experiments involving binary trees, binary search trees (BSTs), heaps, and heap sort. It includes writing programs to: 1) build a binary tree, traverse it in various orders, transform a tree, and represent expressions as binary trees. 2) implement a BST with insertion, search, and deletion and find predecessors and successors. 3) find properties of BSTs like height and node counts. 4) implement priority queues as heaps and perform heap sort.

    Original Description:

    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
    This document outlines experiments involving binary trees, binary search trees (BSTs), heaps, and heap sort. It includes writing programs to: 1) build a binary tree, traverse it in various orders, transform a tree, and represent expressions as binary trees. 2) implement a BST with insertion, search, and deletion and find predecessors and successors. 3) find properties of BSTs like height and node counts. 4) implement priority queues as heaps and perform heap sort.

    Copyright:

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

    Lab 9

    Uploaded by

    Naveenjot Kaur
    This document outlines experiments involving binary trees, binary search trees (BSTs), heaps, and heap sort. It includes writing programs to: 1) build a binary tree, traverse it in various orders, transform a tree, and represent expressions as binary trees. 2) implement a BST with insertion, search, and deletion and find predecessors and successors. 3) find properties of BSTs like height and node counts. 4) implement priority queues as heaps and perform heap sort.

    Copyright:

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

    Experiment 9 (Binary Trees, BST, Heaps, Heap sort)

    I. (a) WAP to build a binary tree for the given elements (integers) and also give traversal
    functions : inorder, preorder, postorder.
    (b) WAP to traverse a given binary tree in inorder, preorder, postorder, converse inorder,
    converse preorder, converse postorder fashion. (converse - traverse in a reverse direction)
    (c) WAP to transform given tree into a binary tree.
    (d) WAP to represent an arithmetic expression in binary tree format.
    II. (a) WAP to implement BST with insertion, search and deletion operation for the elements as
    strings.
    (b) WAP using function to find inorder-predecessor and inorder-successor for any node in a
    BST.
    (c) WAP using functions to find the height, number of levels, number of leave nodes,
    number of internal nodes and total number of nodes in the given BST.
    III. (a) WAP to implement priority queues using heaps (min heap or max heap) with add and
    delete functions.
    (b) WAP to perform heap sort on the given list of elements.

    You might also like