Binary Search Tree usage:

Write a program to compare the time taken for a search in a skewed tree, a balanced tree, and a random tree. Specically, your program should do the following.

• Input an integer x. (Should work with big numbers, such as 10⁶.)
• Create a completely-skewed binary search tree S containing 1; 2; : : : ; x.
• Create a completely-balanced binary search tree B containing the same numbers. (You can use the same idea of the level-order method to insert the numbers in the order needed to obtain the tree balanced.)
• Create a binary search tree R containing x integers generated at random. (To minimize the risk of repetitions, you can multiply the value returned by random() by 10⁶.)
• Search for a leaf in S and B, and for a new random number in R, and show the time taken for each search in the screen.

 

Posted Date: 2/12/2013 4:29:09 AM | Location : United States

Ask an Expert

Related Discussions:- Design a binary search tree, Assignment Help, Ask Question on Design a binary search tree, Get Answer, Expert's Help, Design a binary search tree Discussions

Write discussion on Design a binary search tree
Your posts are moderated

Write your message here..

Related Questions

Linked list, How to creat ATM project by using double linked list? How to creat ATM project by using double linked list?

Name the five popular hashing functions, Five popular hashing functions are... Five popular hashing functions are as follows: 1) Division Method 2) Midsquare Method 3) Folding Method 4) Multiplicative method 5) Digit Analysis

CREATING ENSEMBLE NEERAL NETWORK, HOW DO I CREATE ENSEMBLE NETWORK IN MATLA... HOW DO I CREATE ENSEMBLE NETWORK IN MATLAB

Pseudocode algorithm to print the numbers from 1 to 10, 1. Write a pseudoco... 1. Write a pseudocode algorithm to print the numbers from 1 to 10, and then from 10 to 1, using exactly one loop. 2. The function contains() takes a food as an argument and tell

Implementation of stack using arrays, A Stack has an ordered list of elemen... A Stack has an ordered list of elements & an array is also utilized to store ordered list of elements. Therefore, it would be very simple to manage a stack by using an array. Thoug

Doubly linked list, How does operations like insertion, deletion occur? How does operations like insertion, deletion occur?

Insert function, INSERT FUNCTION /*prototypes of insert & find function... INSERT FUNCTION /*prototypes of insert & find functions */ list * insert_list(list *); list * find(list *, int); /*definition of  anyinsert function */ list * inser

Perform inorder, QUESTION (a) Construct a binary tree for the following... QUESTION (a) Construct a binary tree for the following numbers assuming that a number greater than the node (starting from the root) goes to the left else it goes to the right.

Program insertion of a node into any circular linked list, Program Insertio... Program Insertion of a node into any Circular Linked List Figure depicts a Circular linked list from which an element was deleted. ALGORITHM (Deletion of an element from a

Explain the term - branching, Explain the term - Branching There are t... Explain the term - Branching There are two common ways of branching: case of ..... otherwise ...... endcase  if ..... then ..... else ..... endif   case of