Scribd Logo
Upload

Welcome to Scribd!

  • BST Worksheet

    Uploaded by

    Zelop Drew
    9 views1 page
    This document contains 6 problems to practice building and traversing binary search trees. Problem 1 has the user build a binary search tree by adding numbers in a given order. Problems 2 asks about the height, subtree height, and depth of nodes in the tree from Problem 1. Problem 3 has the user build another binary search tree by adding more numbers in order. Problem 4 checks if this new tree is balanced and discusses search time. Problem 5 adds a new value to the first tree. Problem 6 asks for traversals of the second tree.

    Original Description:

    Original Title

    BST Worksheet.docx

    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 6 problems to practice building and traversing binary search trees. Problem 1 has the user build a binary search tree by adding numbers in a given order. Problems 2 asks about the height, subtree height, and depth of nodes in the tree from Problem 1. Problem 3 has the user build another binary search tree by adding more numbers in order. Problem 4 checks if this new tree is balanced and discusses search time. Problem 5 adds a new value to the first tree. Problem 6 asks for traversals of the second tree.

    Copyright:

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

    BST Worksheet

    Uploaded by

    Zelop Drew
    This document contains 6 problems to practice building and traversing binary search trees. Problem 1 has the user build a binary search tree by adding numbers in a given order. Problems 2 asks about the height, subtree height, and depth of nodes in the tree from Problem 1. Problem 3 has the user build another binary search tree by adding more numbers in order. Problem 4 checks if this new tree is balanced and discusses search time. Problem 5 adds a new value to the first tree. Problem 6 asks for traversals of the second tree.

    Copyright:

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

    In this worksheet we will practice the concepts of using a Binary Search Tree for the Bag

    interface. For each of the following problems, draw the resulting Binary Search Tree.

    1. Add the following numbers, in the order given to a binary search tree.
    45, 67, 22, 100, 75, 13, 11, 64, 30
    2. What is the height of the tree from #1?
    What is the height of the subtree rooted at the node holding the value 22?
    What is the depth of the node holding the value 22?
    Create the PreOrder, InOrder and PostOrder traversal of tree in #1

    3. Add the following numbers, in the order given to a binary search tree.

    3, 14, 15, 20, 25, 30, 33, 62, 200.

    4. Is the tree from #3 balanced? Why not?

    What is the execution time required for searching for a value in this tree?

    5. Add a new value, 145, to the tree from #1


    6. Create the PreOrder, InOrder and PostOrder traversal of tree in #3

    You might also like