Scribd Logo
Importer

Bienvenue sur Scribd !

  • Void Preorder (Tnode Root) (// Your Code) : Marks: 1+1+2+6

    Transféré par

    Anonymous iEQTV7gY
    7 vues1 page
    This document contains an assignment for a data structures and algorithms course. It has 3 questions - the first asks to write a function for preorder traversal in a binary search tree, the second asks to write a function to find the maximum value in a BST, and the third asks questions about a sample binary tree including identifying the root node, depth, leaf nodes, and providing preorder, inorder and postorder expressions for the tree.

    Description originale:

    edtyertyrfyjyiy6ey

    Titre original

    Assignment 3

    Copyright

    © © All Rights Reserved

    Formats disponibles

    DOCX, PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    This document contains an assignment for a data structures and algorithms course. It has 3 questions - the first asks to write a function for preorder traversal in a binary search tree, the second asks to write a function to find the maximum value in a BST, and the third asks questions about a sample binary tree including identifying the root node, depth, leaf nodes, and providing preorder, inorder and postorder expressions for the tree.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme DOCX, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    7 vues1 page

    Void Preorder (Tnode Root) (// Your Code) : Marks: 1+1+2+6

    Transféré par

    Anonymous iEQTV7gY
    This document contains an assignment for a data structures and algorithms course. It has 3 questions - the first asks to write a function for preorder traversal in a binary search tree, the second asks to write a function to find the maximum value in a BST, and the third asks questions about a sample binary tree including identifying the root node, depth, leaf nodes, and providing preorder, inorder and postorder expressions for the tree.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme DOCX, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 1

    UMT

    #3

    BSEE
    Spring 2016
    Due Date: May 19

    Section:

    EE213 Data Structures and Algorithms

    Name:

    Assignment
    ID:

    Q1. Write a function for preorder traversal in a BST.

    (5 marks)

    void preorder(TNode * root){


    // Your code
    }
    Q2. Write a code to find the maximum value in a BST.

    (5 marks)

    void max(TNode * root ){


    // Your code
    }
    Q3.
    1+1+2+6)

    (Marks:

    For the tree in Figure below:


    Q1. Which node is the root?
    Q2. What is the depth of the tree?
    Q3. Which nodes are leaves?
    Q4. Give the preorder, inorder, and postorder expressions corresponding to
    the tree.

    Vous aimerez peut-être aussi