Avl trees and unbalanced binary search trees

Assignment Help Basic Computer Science

Reference no: EM13968087

1. Write a program to perform random operations on splay trees. Count the total number of rotations performed over the sequence. How does the running time compare to AVL trees and unbalanced binary search trees?

2. Write ef?cient functions that take only a pointer to the root of a binary tree, T, and compute

a. the number of nodes in T

b. the number of leaves in T

c. the number of full nodes in T

What is the running time of your routines?

Reference no: EM13968087

Questions Cloud

What employers are looking for attributes of professionalism : Fill the 7 attributes above with examples. Cross reference the 6 items what employers are looking for above with the 7 attributes of professionalism.

Find the amount of discrepancy the speaker : Find the amount of discrepancy the speaker should aim for to maximize the attitude change in the audience.

Balanced binary search tree of height : Write a function to generate a perfectly balanced binary search tree of height h with keys 1 through 2h+1 - 1. What is the running time of your function?

Design a recursive linear-time algorithm : 1. Design a recursive linear-time algorithm that tests whether a binary tree satis?es the search tree order property at every node. 2. Write a recursive function that takes a pointer to the root node of a tree T and returns a pointer to the root node..

Avl trees and unbalanced binary search trees : Write a program to perform random operations on splay trees. Count the total number of rotations performed over the sequence. How does the running time compare to AVL trees and unbalanced binary search trees?

What is a likely investment it would consider and why : Evaluate the approximate costs and benefits of the investment you identified, explaining how these would affect your spreadsheet projections and business decisions

Implement avl single and double rotations : 1. Show the result of inserting 2, 1, 4, 5, 9, 3, 6, 7 into an initially empty AVL tree. 2. Keys 1, 2, ... , 2k - 1 are inserted in order into an initially empty AVL tree. Prove that the resulting tree is perfectly balanced. 3. Write the remaining pr..

Minimum number of nodes : 3. * a. Give a precise expression for the minimum number of nodes in an AVL tree of height h. b. What is the minimum number of nodes in an AVL tree of height 15?

Distance between the observation point : Find the distance between the observation point and the base of the Space Needle.

User Account

All Pages