Purchase Solution

C++ Binary Search Tree

Not what you're looking for?

Ask Custom Question

Use the attached Binary Search Tree template (BST.h) for the following exercises.

1. Write a recursive member function level() for class template BST(Binary Search Tree) that determines the level in the BST at which a specified item is located. The root of the BST is at level 0, its children are at level 1, and so on.

2. Write a recursive member function leafCount() for class template BST to count the leaves in a binary tree.
[Hint: How is the number of leaves in the entire tree related to the number of leaves in the left and right subtrees of that root?]

Attachments
Purchase this Solution
Solution Summary

Attached 220833.h also fixes some compilation errors in BST.h apart from adding new public functions (getLevel, getLeafCount) and new private functions (level, leafCount).

Purchase this Solution
Free BrainMass Quizzes
Basic Networking Questions

This quiz consists of some basic networking questions.

C# variables and classes

This quiz contains questions about C# classes and variables.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

View More Free Quizzes
Related BrainMass Solutions

  • Problems about binary search tree in Java

    Note: Empty binary trees should also be considered to be binary search trees. public boolean isBinarySearchTree() // post: returns true iff this is a binary search tree a.

  • binary search tree

    see attached file see attached file A binary search tree

  • converting ternary to binary

    The expert converts a ternary tree into a binary search tree.

  • Working with the binary search tree

    This job focuses on working with the binary search tree

  • Graph Theory -Tree and Tree Structures

    c) There are several methods that can be used to traverse and search a tree.

  • Hashing: separate chaining method

    The solution makes use of brief comparative analysis of linked list and balanced binary search tree.

  • Binary Search Trees in C++

    A C++ program is written to implement phone book application using template based Binary Search Tree algorithm.

  • ADT table in Java

    Advantage: Quick to search and retrieval easier to implement than binary search tree. ii. Disadvantages: Slow to insert and delete. Slower than binary search tree in regard to search and retrieval 3. Unordered Vector: i.

  • tree structure search and update

    22253 tree structure search and update In a binary tree the search is log (x) and the update is x where x is teh depth of the tree. Is this correct? In tree like structure (tree structure) what is the maximum number of access for record update?

  • Binary Tree Delete Java

    129940 Binary Tree Delete Java (Binary Tree Delete) In this exercise, we discuss deleting items from binary search trees. The deletion algorithm is not as straightforward as the insertion algorithm.

View More Related Solutions