Scribd Logo
Upload

Welcome to Scribd!

  • NAS Assignment 1

    Uploaded by

    computer science engineering
    39 views1 page
    The document outlines 5 questions for an assignment on data structures, asking students to define a binary tree, determine the height of a complete binary tree, write a program to implement binary search tree operations, determine a binary tree from its inorder and postorder traversals, describe avl tree rotations and construct an avl tree from given nodes, and explain binary search trees and draw one from a sequence of numbers showing all steps.

    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
    The document outlines 5 questions for an assignment on data structures, asking students to define a binary tree, determine the height of a complete binary tree, write a program to implement binary search tree operations, determine a binary tree from its inorder and postorder traversals, describe avl tree rotations and construct an avl tree from given nodes, and explain binary search trees and draw one from a sequence of numbers showing all steps.

    Copyright:

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

    NAS Assignment 1

    Uploaded by

    computer science engineering
    The document outlines 5 questions for an assignment on data structures, asking students to define a binary tree, determine the height of a complete binary tree, write a program to implement binary search tree operations, determine a binary tree from its inorder and postorder traversals, describe avl tree rotations and construct an avl tree from given nodes, and explain binary search trees and draw one from a sequence of numbers showing all steps.

    Copyright:

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

    PAPER

    CODE KCS 3 0 1 Rol


    lNumber

    BANSALI
    NSTI
    TUTEOFENGI
    NEERI
    NGANDTECHNOLOGY
    (
    Aff
    il
    iat
    edt
    oDr
    .APJAbdulKal
    am Techni
    calUni
    ver
    sit
    y,Lucknow)
    Assi
    gnment3-OddSemest er2020-2021
    Programme:B.Tech(CSE/
    IT) Semester:3rd
    SubjectCode:KCS-
    301 Subject
    :DATASTRUCTURE M.
    M.10
    KL1-Remember i
    ng KL4-Analyzi
    ng
    Knowl
    edgeLev
    el(
    KL) KL2-Understanding KL5-Evaluat
    ing
    KL3-Applyi
    ng KL6-Creati
    ng
    Dat
    eofAssi
    gnment:28NOV20 Lastdateofsubmi ssi
    on:03DEC2020

    1. Whatisbi
    narytr
    ee?Deter
    minethehei
    ghtofacompl
    etebi
    naryt
    reewi
    thnnumberof C05 KL2
    nodes.
    2. Writ
    eaCpr ogr
    am codetoimpl
    ementall
    theOper
    ati
    oninBST. C05 KL3

    3. I
    ftheinor
    dertr
    aver
    salofabinar
    ytreei
    sB,I,D,A,C,G,E,H,Fandi
    tspost
    order C05 KL3
    t
    raver
    sali
    sI,
    D,B,G,C,H,
    F,E,
    A.Determi
    net
    hebinar
    ytree.
    4. Descri
    beAVLTREE&al lrotat
    ionsinAVLt r
    ee.Constr
    uctAVLt reef
    rom t
    hefol
    l
    owing C05 KL2
    nodes:64,1,
    44,26,
    13,110,
    98,85.
    5. Explai
    nbi narysearcht r
    eeandi t
    soper ati
    ons.Draw abinarysearchtreef
    orthe C05 KL3
    fol
    lowing sequence of the numbers, show al
    l steps:
    45,
    32,90,
    34,68,72,
    15,24,
    30,66,
    11,50,
    10.

    You might also like