Scribd Logo
Upload

Welcome to Scribd!

  • Data StructuresIII

    Uploaded by

    CAUVERY INSTITUTE OF TECHNOLOGY MANDYA
    4 views1 page
    This document contains an internal assessment from the Cauvery Institute of Technology's Department of Computer Science and Engineering. It provides six questions on data structures and trees to answer, including defining terms related to trees, explaining heap operations, binary tree traversals, threaded binary trees, and a proof related to leaf nodes in binary trees. Students are instructed to answer any four questions in one hour.

    Original Description:

    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 contains an internal assessment from the Cauvery Institute of Technology's Department of Computer Science and Engineering. It provides six questions on data structures and trees to answer, including defining terms related to trees, explaining heap operations, binary tree traversals, threaded binary trees, and a proof related to leaf nodes in binary trees. Students are instructed to answer any four questions in one hour.

    Copyright:

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

    Data StructuresIII

    Uploaded by

    CAUVERY INSTITUTE OF TECHNOLOGY MANDYA
    This document contains an internal assessment from the Cauvery Institute of Technology's Department of Computer Science and Engineering. It provides six questions on data structures and trees to answer, including defining terms related to trees, explaining heap operations, binary tree traversals, threaded binary trees, and a proof related to leaf nodes in binary trees. Students are instructed to answer any four questions in one hour.

    Copyright:

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

    Cauvery Institute of Technology

    Department of Computer Science and Engineering


    Improvement Internal Assessment
    Sub: Data Structures with C sub-code: 10CS35 Date: 16-NOV-2015 Duration: 1 hour
    Note: Answer any four questions.
    1. Define the following terms with an example.
    Tree Siblings Leaf node Level of a tree Complete Binary tree
    2. Define heap. Write a function to insert and delete an element from heap.
    3. Define Binary tree. Explain the various Binary tree traversals with an example.
    4. Define Threaded binary tree. Define left in threaded, right in threaded & In-threaded Binary tree with an
    example.
    5. Explain left child – right sibling representation of a tree with an example.
    6. Prove that the number of leaf nodes in binary tree is equal to number of nodes of degree-2 plus one.
    (i.e. n0=n2+1)

    Cauvery Institute of Technology


    Department of Computer Science and Engineering
    Improvement Internal Assessment
    Sub: Data Structures with C sub-code: 10CS35 Date: 16-NOV-2015 Duration: 1 hour
    Note: Answer any four questions.
    1. Define the following terms with an example.
    Tree Siblings Leaf node Level of a tree Complete Binary tree
    2. Define heap. Write a function to insert and delete an element from heap.
    3. Define Binary tree. Explain the various Binary tree traversals with an example.
    4. Define Threaded binary tree. Define left in threaded, right in threaded & In-threaded Binary tree with an
    example.
    5. Explain left child – right sibling representation of a tree with an example.
    6. Prove that the number of leaf nodes in binary tree is equal to number of nodes of degree-2 plus one.
    (i.e. n0=n2+1)

    Cauvery Institute of Technology


    Department of Computer Science and Engineering
    Improvement Internal Assessment
    Sub: Data Structures with C sub-code: 10CS35 Date: 16-NOV-2015 Duration: 1 hour
    Note: Answer any four questions.
    1. Define the following terms with an example.
    Tree Siblings Leaf node Level of a tree Complete Binary tree
    2. Define heap. Write a function to insert and delete an element from heap.
    3. Define Binary tree. Explain the various Binary tree traversals with an example.
    4. Define Threaded binary tree. Define left in threaded, right in threaded & In-threaded Binary tree with an
    example.
    5. Explain left child – right sibling representation of a tree with an example.
    6. Prove that the number of leaf nodes in binary tree is equal to number of nodes of degree-2 plus one.
    (i.e. n0=n2+1)

    Cauvery Institute of Technology


    Department of Computer Science and Engineering
    Improvement Internal Assessment
    Sub: Data Structures with C sub-code: 10CS35 Date: 16-NOV-2015 Duration: 1 hour
    Note: Answer any four questions.
    1. Define the following terms with an example.
    Tree Siblings Leaf node Level of a tree Complete Binary tree
    2. Define heap. Write a function to insert and delete an element from heap.
    3. Define Binary tree. Explain the various Binary tree traversals with an example.
    4. Define Threaded binary tree. Define left in threaded, right in threaded & In-threaded Binary tree with an
    example.
    5. Explain left child – right sibling representation of a tree with an example.
    6. Prove that the number of leaf nodes in binary tree is equal to number of nodes of degree-2 plus one.
    (i.e. n0=n2+1)

    You might also like