Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    S.No Problem Statement: WEEK - 12 Avl Tree

    Uploaded by

    Gitika Suma Attaluri
    This document outlines 10 programming problems involving binary search trees (BSTs) and AVL trees. Each problem involves inserting either integers or characters into the tree, and then displaying the elements using inorder, preorder, or postorder traversal. The problems cover performing these basic operations on both regular BSTs and self-balancing AVL trees.

    Copyright:

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

    You might also like

    S.No Problem Statement: WEEK - 12 Avl Tree

    Uploaded by

    Gitika Suma Attaluri
    12 views2 pages
    This document outlines 10 programming problems involving binary search trees (BSTs) and AVL trees. Each problem involves inserting either integers or characters into the tree, and then displaying the elements using inorder, preorder, or postorder traversal. The problems cover performing these basic operations on both regular BSTs and self-balancing AVL trees.

    Original Description:

    Program

    Original Title

    week-12

    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 10 programming problems involving binary search trees (BSTs) and AVL trees. Each problem involves inserting either integers or characters into the tree, and then displaying the elements using inorder, preorder, or postorder traversal. The problems cover performing these basic operations on both regular BSTs and self-balancing AVL trees.

    Copyright:

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

    S.No Problem Statement: WEEK - 12 Avl Tree

    Uploaded by

    Gitika Suma Attaluri
    This document outlines 10 programming problems involving binary search trees (BSTs) and AVL trees. Each problem involves inserting either integers or characters into the tree, and then displaying the elements using inorder, preorder, or postorder traversal. The problems cover performing these basic operations on both regular BSTs and self-balancing AVL trees.

    Copyright:

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

    WEEK - 12

    AVL TREE

    S.No Problem Statement

    1 Write a C program to perform the following operations on BST:


    a) Insert integers into an BST.
    b) Display elements of BST Tree using Inorder
    2 Write a C program to perform the following operations on BST:
    a) Insert characters into an BST.
    b) Display elements of BST Tree using Preorder
    3 Write a C program to perform the following operations on BST:
    a) Insert integers into an BST.
    b) Display elements of BST Tree using Postorder
    4 Write a C program to perform the following operations on BST:
    a) Insert characters into an BST.
    b) Display elements of BST Tree using Inorder
    5 Write a C program to perform the following operations on BST:
    a) Insert integers into an BST.
    b) Display elements of BST Tree using Preorder
    6 Write a C program to perform the following operations on AVL:
    a) Insert integers into an AVL.
    b) Display elements of AVL Tree using Inorder
    7 Write a C program to perform the following operations on AVL:
    a) Insert characters into an AVL.
    b) Display elements of AVL Tree using Preorder
    8 Write a C program to perform the following operations on AVL:
    a) Insert integers into an AVL.
    b) Display elements of AVL Tree using Postorder
    9 Write a C program to perform the following operations on AVL:
    a) Insert characters into an AVL.
    b) Display elements of AVL Tree using Inorder

    10 Write a C program to perform the following operations on AVL:


    a) Insert integers into an AVL.
    b) Display elements of AVL Tree using Preorder

    You might also like