Java class quiz question If you add ten nodes into a heap what would be the...

Question

Question

Java class quiz question If you add ten nodes into a heap what would be the...

Java class quiz question

If you add ten nodes into a heap what would be the maximum height of the tree generated?

	A.	10
	B.	5
	C.	4
	D.	3
	E.	2

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

nodes = 2^h⁺¹ -1

10 = 2^h⁺¹ -1

2^h⁺¹ = 11

The maximum height of the heap is 3 at that value it greater than 11.

Option d

Add a comment

Answer 2

Similar Homework Help Questions

Java quiz need help :Add the following numbers in the order given to a (min) heap...

Java quiz need help :Add the following numbers in the order given to a (min) heap using the heap add algorithm (with trickle-up). 23 - 57 - 12 - 85 - 72 - 55 - 8 - 49 - 88 - 62 - 11 - 94 Draw the generated heap (10 points) Then delete three elements from that heap using the heap remove algorithm and draw the resulting heap. (10 points)
2)A heap is a binary tree. What operations does a heap add to the BinaryTree interface?...

2)A heap is a binary tree. What operations does a heap add to the BinaryTree interface? 3) When does a 2-node become a 3-node? 4) Is every tree a graph? Is every graph a tree? Explain
I need this in Java: /** * Class for storing the last ten integers added. *...

I need this in Java: /** * Class for storing the last ten integers added. * * Your class should be named LastTen. * * Your class should implement two public methods as described below: * 1. void add(int newValue): * add a new integer to the values that we are rememebring * 2. int[] getLastTen(): * return the last ten values that were added using add, in any order. * If fewer than ten values were added, you should...

Trees and Heaps 1. Show that the maximum number of nodes in a binary tree of...

Trees and Heaps 1. Show that the maximum number of nodes in a binary tree of height h is 2h+1 − 1. 2. A full node is a node with two children. Prove that the number of full nodes plus one is equal to the number of leaves in a nonempty binary tree. 3. What is the minimum number of nodes in an AVL tree of height 15? 4. Show the result of inserting 14, 12, 18, 20, 27, 16,...
Please finish all the questions,Thanks Following is Appendix assume the definition of Java class Heap given in the App...

Please finish all the questions,Thanks Following is Appendix assume the definition of Java class Heap given in the Appendix For this question, a. (2 marks Consider the following heap 30 12 20 19 6 10 18 Given the array representation of a heap discussed in class, what is the array that corre sponds to this heap? b. (5 marks) Successively insert into the heap of part (a.) 22, 35 and 11, in that order. Use the standard heap insertion algorithm....
1. In a heap, the upper bound on the number of leaves is: (A) O(n) (B)...

1. In a heap, the upper bound on the number of leaves is: (A) O(n) (B) O(1) (C) O(logn) (D) O(nlogn) 2. In a heap, the distance from the root to the furthest leaf is: (A) θ(nlogn) (B) θ(logn) (C) θ(1) (D) θ(n) 3. In a heap, let df be the distance of the furthest leaf from the root and let dc be the analogous distance of the closest leaf. What is df − dc, at most? (A) 1 (C)...

please do this lab in Java in given instructions by tomorrow morning. TkA CHRI - TREE...

please do this lab in Java in given instructions by tomorrow morning. TkA CHRI - TREE UTH A HEAPOF PRESDNS CENETH CSC 236-Lab 6 (2 programs) trees 1. Given the two binary trees below: 14 18 16) Write a method called swapSubtrees, which swaps all of the left and right subtrees in the above binary trees. Add this method to the class BinaryTree and create a program to test this method for these 2 trees. Show the original trees and...
Beginning with an empty binary search tree, what binary search tree is formed when you add the following letters in the order given?

Trees-related questionsBeginning with an empty binary search tree, what binary search tree is formed when you add the following letters in the order given? J, N, B, A, W, E, TRepresent the following binary tree with an array What is the result of adding 3 and 4 to the 2-3 tree shown below?Why does a node in a red-black tree require less memory than a node in a 2-3-4 tree?Why can’t a Red-Black Tree have a black child node with exactly...
SECTION B (4 QUESTIONS, 90 MARKS) Question 4. [32 marks in total] For this question, assume the definition of Java clas...

SECTION B (4 QUESTIONS, 90 MARKS) Question 4. [32 marks in total] For this question, assume the definition of Java class Heap given in the Appendix. The heaps referred to in this question are all maxHeaps. a. (5 marks) Insert into an empty (binary) heap the values 35, 4, 72, 36, 49, 50. Draw all intermediate steps b. (3 marks) Carry out one deletion operation on the final heap in (a.) above. c. (2 marks) Give the worst-case time complexity...

java AVL tree a). What are the conditions that must exist in a binary tree for calling the left and the right rotation? b). What is the smallest height that a tree of 1000 nodes can be? What is the bi...

java AVL tree a). What are the conditions that must exist in a binary tree for calling the left and the right rotation? b). What is the smallest height that a tree of 1000 nodes can be? What is the biggest? Please be very specific, thank you.

Java class quiz question If you add ten nodes into a heap what would be the...

Homework Answers

Add Answer to:
Java class quiz question If you add ten nodes into a heap what would be the...

Post as a guest

Earn Coins

Java quiz need help :Add the following numbers in the order given to a (min) heap...

2)A heap is a binary tree. What operations does a heap add to the BinaryTree interface?...

I need this in Java: /** * Class for storing the last ten integers added. *...

Trees and Heaps 1. Show that the maximum number of nodes in a binary tree of...

Please finish all the questions,Thanks Following is Appendix assume the definition of Java class Heap given in the App...

1. In a heap, the upper bound on the number of leaves is: (A) O(n) (B)...

please do this lab in Java in given instructions by tomorrow morning. TkA CHRI - TREE...

Beginning with an empty binary search tree, what binary search tree is formed when you add the following letters in the order given?

SECTION B (4 QUESTIONS, 90 MARKS) Question 4. [32 marks in total] For this question, assume the definition of Java clas...

java AVL tree a). What are the conditions that must exist in a binary tree for calling the left and the right rotation? b). What is the smallest height that a tree of 1000 nodes can be? What is the bi...

Java class quiz question If you add ten nodes into a heap what would be the...

Homework Answers

Add Answer to: Java class quiz question If you add ten nodes into a heap what would be the...

Post as a guest

Earn Coins

Add Answer to:
Java class quiz question If you add ten nodes into a heap what would be the...