Nodes of a binary tree in level-order

Assignment Help Basic Computer Science

Reference no: EM13968097

1. Write a routine to list out the nodes of a binary tree in level-order. List the root, then nodes at depth 1, followed by nodes at depth 2, and so on. You must do this in linear time. Prove your time bound.

2. * a. Write a routine to perform insertion into a B-tree.

* b. Write a routine to perform deletion from a B-tree. When an item is deleted, is it necessary to update information in the internal nodes?

* c. Modify your insertion routine so that if an attempt is made to add into a node that already has M entries, a search is performed for a sibling with less than M children before the node is split.

Reference no: EM13968097

Questions Cloud

Modify the binary search tree to support : Suppose we want to add the operation findKth to our repertoire. The opera- tion findKth(k) returns the kth smallest item in the tree. Assume all items are distinct. Explain how to modify the binary search tree to support this opera- tion in O(log ..

How does each sort of capital assist in start up : What sorts of asset or capital availability for a new business owner-small start up. How does each sort of capital assist in start up and continuing business operation over the first few years.

Describe a method to perform insertion : A B∗-tree of order M is a B-tree in which each interior node has between 2M/3 and M children. Describe a method to perform insertion into a B∗-tree.

What is the distance between the observer : What is the distance between the observer and Q? 2) how much elevation did the plane gain between P and Q?

Nodes of a binary tree in level-order : 1. Write a routine to list out the nodes of a binary tree in level-order. List the root, then nodes at depth 1, followed by nodes at depth 2, and so on. You must do this in linear time. Prove your time bound.

General-purpose tree-drawing program : Write a general-purpose tree-drawing program that will convert a tree into the following graph-assembler instructions:

Find the profit from operating the shop : Also, the shop will lose $75 per day at a sales level of x=0. Find the profit from operating the shop at a sales level of x ties per day.

Assigning the inorder traversal number : a. The x coordinate can be computed by assigning the inorder traversal number. Write a routine to do this for each node in the tree. b. The y coordinate can be computed by using the negative of the depth of the node. Write a routine to do this for ea..

How do you think twitter uses a data warehouse : Do you agree that a business can use Twitter to gain business intelligence? How many companies do you think are aware of Twitter and exactly how they can use it to gain BI? How do you think Twitter uses a data warehouse?

User Account

All Pages