Suppose that a full m-ary tree T has 109 vertices and height 2. (a) What are...

Question

Question

Suppose that a full m-ary tree T has 109 vertices and height 2.

(a) What are the possible values of m?

(b) Assume also that T has at least 84 leaves. Now what are the possible values of m?

(c) What value of m maximizes the number of internal vertices in T?

(d) For this value of m identify the number of leaves and number of internal vertices at

each level of T.

engineering Computer-Science

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

Suppose that a full m-ary tree T has 109 vertices and height 2. (a) What are the possible values of m? (b) Assume also that T has at least 84 leaves. Now what are the possible values of m? (c) What v...

Suppose that a full m-ary tree T has 109 vertices and height 2. (a) What are the possible values of m? (b) Assume also that T has at least 84 leaves. Now what are the possible values of m? (c) What value of m maximizes the number of internal vertices in T? (d) For this value of m identify the number of leaves and number of internal vertices at each level of T.
suppose that a full 4-ary tree has 100 leaves. howmany internal vertices does it have? please...

suppose that a full 4-ary tree has 100 leaves. howmany internal vertices does it have? please explain in detail. i dont want to know about no. of vertices i just need to find internal vertices . can you also explain how is 4 ary tree look alike.? thanks,
1. If T is a tree with 999 vertices, then T has_edges (5 pts) 2. There...

1. If T is a tree with 999 vertices, then T has_edges (5 pts) 2. There are 3. The best comparison-based sorting algorithms for a list of n items have complexity ). (5 pts) 4. If T is a binary tree with 100 vertices, its minimum height is 5. If T is a full binary tree with 101 vertices, its maximum height is 6. If T is a full binary tree with 50 leaves, its minimum height is 7. Every...

Subject is Graph Theory Problem 3. What is the maximum number of vertices (internal and leaves)...

Subject is Graph Theory Problem 3. What is the maximum number of vertices (internal and leaves) in an m-ary tree of height h?
1. Suppose the address of vertex v in the ordered rooted tree T is 4.5.4.6. At...

1. Suppose the address of vertex v in the ordered rooted tree T is 4.5.4.6. At what level is v? What is the address of the parent of v? What is the least number of siblings v can have? What is the smallest possible number of vertices in T? If v has two children, what are their addresses? 2. Suppose the address of vertex v in the ordered rooted tree T is 4.3.5.3.4. At what level is v? What is...
Discrete Structures 3. Suppose that the address of the vertex v in the ordered rooted tree T is 3.4.5.2.4 At what level is v? What is the address of the parent of v? What can you conclude about t...

Discrete Structures 3. Suppose that the address of the vertex v in the ordered rooted tree T is 3.4.5.2.4 At what level is v? What is the address of the parent of v? What can you conclude about the number of siblings v? What is the smallest possible number of vertices in T? List the other addresses that must occur 3. Suppose that the address of the vertex v in the ordered rooted tree T is 3.4.5.2.4 At what level...

(2 points) A full binary tree has a start node, internal nodes, and leaf nodes. The...

(2 points) A full binary tree has a start node, internal nodes, and leaf nodes. The number of leaf nodes of this binary tree is 256. a) What is the height of the tree? b) How many internal nodes are in this tree?
The first and second picture are the definition of 2-3 tree，3rd and 4th are the pre-condition...

The first and second picture are the definition of 2-3 tree，3rd and 4th are the pre-condition and post-condition. Please use these question to solve problem 8，the last photo. 2-3 Trees: Definition Suppose that E is an ordered type, that is, a nonempty set of values that have a total order. A 2-3-tree, for type E, is a finite rooted tree T (like a binary search tree or a red-black tree) that satisfies the following 2-3 Tree Properties: (a) Every leaf...
Sc Python 1 Task 2 3 Consider a binary tree of N vertices 4 such that children of node K are 2* K + 1. Vertex 1...

Sc Python 1 Task 2 3 Consider a binary tree of N vertices 4 such that children of node K are 2* K + 1. Vertex 1 is the root Kand 2 of the tree and each node has an integer value associated with it. Such a tree may be represented as an array of N integers by writing down values from consecutive nodes For example, the tree below 8 Test might be represented as an array o A node...

2) a) Consider a modified red-black tree which satisfies all the usual conditions for a red-black tree exceptthat the root may be either black or red. Suppose a modified red-black tree T has a red roo...

2) a) Consider a modified red-black tree which satisfies all the usual conditions for a red-black tree exceptthat the root may be either black or red. Suppose a modified red-black tree T has a red root node. If we recolor the root node black, is the resulting tree a “normal” red-black tree? b) What is the largest and smallest number of nodes in a red-black tree with black-height k?