Purchase Solution

binary search tree

Not what you're looking for?

Ask Custom Question

Among other things, a binary search tree can be used for sorting data elements. This project is to randomly generate a sequence of integer numbers, insert the first 20 distinct numbers into a binary search tree, and finally produce an in-order listing of the tree. You are provided with the declarations and two functions for binary search trees (see the appended). One of the functions is Insert that adds a new element to a binary search tree. And the other is a lookup which checks if a given element is already in a binary search tree. In this project, you need to define a print function that prints tree elements in in-order as well as a count function that counts and returns the number of tree nodes in a binary search tree. In addition you need to complete the main function. You may use the built-in random number function to generate new elements for inserting as shown below:

srand(time(NULL)); //do it at the beginning of main function
newElem = rand() % 100;
//generate a new element one at a time
Then you can check for each new element if it is already there using the lookup function and if there are enough elements in the tree using the count function before doing insert. Finally, use the print function to show the result.

see attached file

Attachments
Purchase this Solution
Solution Summary

A binary search tree

Purchase this Solution
Free BrainMass Quizzes
Basic Networking Questions

This quiz consists of some basic networking questions.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

C# variables and classes

This quiz contains questions about C# classes and variables.

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.

Javscript Basics

Quiz on basics of javascript programming language.

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.

  • 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

  • Hashing: separate chaining method

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

  • 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?

  • Graph Theory -Tree and Tree Structures

    Difference between binary and n-ary trees: In a binary tree, each node has at most two children. In a n-ary tree, each node can have any number of children. b) Please refer to the attachment.

  • C++ Binary Search Tree

    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.

  • C++ Binary Tree Sorting of text words

    A Binary Tree is used to sort words read from a text. A text is provided in a file and is parsed by the program by certain rules and inserted into a binary tree. Binary tree is then used to display sorted results.

View More Related Solutions