Homework Answers
![Problem - 4 = cof IT B -তিও Order-5 6111626 14|| থ [6াড়ি |6 | 7 |||| IO| *B/15/12 19|a||2||BS 26||a||2|59 3[30|33||3] 38||2|](http://img.homeworklib.com/questions/32977fd0-f4ab-11eb-ae52-7525a48d7e86.png?x-oss-process=image/resize,w_560)
I
am not sure about third problem that's why I have skip this...
Remaining is fine.
Build a splay tree inserting keys: 2, 13, 17, 4, 7, 19, 5, 8, 22, 6,...
Build a splay tree inserting keys: 2, 13, 17, 4, 7, 19, 5, 8, 22, 6, 10. Show each step! a. Show the result of accessing keys 5, 8, 7 in order in the splay tree. Show the tree after each access. b. Show the result of deleting keys 10, 8, 7 in the splay tree. Start with the original tree and show the tree after each deletion.
Show the result of inserting 3, 1, 4, 6, 9, 2, 5, 7 into an AVL...
Show the result of inserting 3, 1, 4, 6, 9, 2, 5, 7 into an AVL tree. Make sure to show each rotation. Note: There are no double rotations in this sequence.
1. [10 pts.] AVL Trees: Example Operations (a) [5 pts.] Draw the AVL tree that results...
1. [10 pts.] AVL Trees: Example Operations
(a) [5 pts.] Draw the AVL tree that results from inserting key
45 into the following AVL
tree.
(b) [5 pts.] Draw the AVL tree that results from deleting key 70
from the following AVL
tree. NOTE: When deleting a key from an AVL tree, please follow the
textbook approach
of finding the node with the key using the function for standard
binary search trees.
If the key is in the tree and...
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,...
8. Given the BST below, show the BST that would result after inserting the key of value 180 if sp...
8. Given the BST below, show the BST that would result after inserting the key of value 180 if splaying is performed starting at the node that was inserted. 100 50 150 40 60 200 30 9. A nice property of splay trees is that each of Find, Insert and Delete takes O(logn) time. TrueFalse? 10. The keys of value N, N-1, N-2... 4, 3, 2, 1 are inserted in this order in a splay tree. What is the final...
Name (print): Instruction: Answer all the questions. 1. Show the result of inserting 4,2, 5, 7,...
Name (print): Instruction: Answer all the questions. 1. Show the result of inserting 4,2, 5, 7, 10, 3,6, 8 into an initially empty binary search step by step illustration when each number is inserted, starting from 4. [5 points) tree. Show a 2. Show the result of deleting the root. [2 points] Spring 2019 CS 291 Computer Science II 3. Give the prefix, infix, and postfix expressions corresponding to the tree below: 13 points] Prefix expression: Infix expression:
1.(10 pts) Contrast a heap with a binary search tree by inserting the numbers 60, 30,...
1.(10 pts) Contrast a heap with a binary search tree by inserting the numbers 60, 30, 40, 50, 20, 10 first in a BST and then in a min-heap. Draw the resulting BST on the left and the heap on the right. You may draw any valid BST or Heap that contain the provided values 2. (5 pts) In section 11.1, the book mentions that heaps are **complete** binary trees, what does that mean? Demonstrate by drawing an example of...
Given a set of 10 records with priorities S = {10, 15, 3, 8, 20, 5,...
Given a set of 10 records with priorities S = {10, 15, 3, 8, 20, 5, 17, 27, 19, 22}. Construct a 2-3 tree T for S by inserting the records, in the given order, into an initially empty 2-3 tree. When done, delete 10, and then 17 from the tree. Construct a 2-3 tree T for S by inserting the records, in the reverse given order, into an initially empty 2-3 tree. When done, delete 10, and then 17...
answer number 7 5. Draw the binary search tree that would result from inserting the following...
answer number 7
5. Draw the binary search tree that would result from inserting the following numbers into an initially empty tree in the order given: 45, 37, 62, 67, 49, 51, 16, 8, 73, 71, 64, 65 6. Given the tree created in problem 5, draw the tree that would result if you deleted the 37 from the tree? 7. Given the tree created in problem 5, draw the tree that would result if you deleted the 62 from...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw the trees that result from the following operations: (a) Inserting 142, 400, 205, 127, 100, 320, 160, 141, and 110 into an initially-empty tree (in that order). (b) Deleting 142 from the tree you drew for part (a). 4. (8 points) Draw the unique binary tree that has a preorder traversal of 4, 1, 6, 3, 7, 5, 9, 2, 8 and an inorder...
1. [10 pts.] AVL Trees: Example Operations
(a) [5 pts.] Draw the AVL tree that results from inserting key
45 into the following AVL
tree.
(b) [5 pts.] Draw the AVL tree that results from deleting key 70
from the following AVL
tree. NOTE: When deleting a key from an AVL tree, please follow the
textbook approach
of finding the node with the key using the function for standard
binary search trees.
If the key is in the tree and...
8. Given the BST below, show the BST that would result after inserting the key of value 180 if splaying is performed starting at the node that was inserted. 100 50 150 40 60 200 30 9. A nice property of splay trees is that each of Find, Insert and Delete takes O(logn) time. TrueFalse? 10. The keys of value N, N-1, N-2... 4, 3, 2, 1 are inserted in this order in a splay tree. What is the final...
Name (print): Instruction: Answer all the questions. 1. Show the result of inserting 4,2, 5, 7, 10, 3,6, 8 into an initially empty binary search step by step illustration when each number is inserted, starting from 4. [5 points) tree. Show a 2. Show the result of deleting the root. [2 points] Spring 2019 CS 291 Computer Science II 3. Give the prefix, infix, and postfix expressions corresponding to the tree below: 13 points] Prefix expression: Infix expression:
Given a set of 10 records with priorities S = {10, 15, 3, 8, 20, 5, 17, 27, 19, 22}. Construct a 2-3 tree T for S by inserting the records, in the given order, into an initially empty 2-3 tree. When done, delete 10, and then 17 from the tree. Construct a 2-3 tree T for S by inserting the records, in the reverse given order, into an initially empty 2-3 tree. When done, delete 10, and then 17...
answer number 7
5. Draw the binary search tree that would result from inserting the following numbers into an initially empty tree in the order given: 45, 37, 62, 67, 49, 51, 16, 8, 73, 71, 64, 65 6. Given the tree created in problem 5, draw the tree that would result if you deleted the 37 from the tree? 7. Given the tree created in problem 5, draw the tree that would result if you deleted the 62 from...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw the trees that result from the following operations: (a) Inserting 142, 400, 205, 127, 100, 320, 160, 141, and 110 into an initially-empty tree (in that order). (b) Deleting 142 from the tree you drew for part (a). 4. (8 points) Draw the unique binary tree that has a preorder traversal of 4, 1, 6, 3, 7, 5, 9, 2, 8 and an inorder...
Most questions answered within 3 hours.
-
How does a linear regression allow you to better estimate
trends, costs, and other factors in...
asked 6 minutes ago -
1. (15%) Describe the difference between a pull (Kanban), push
and CONWIP production systems.
asked 2 minutes ago -
QUESTION 5
The total area under the Z distribution curve is equal to:
a.
10
b....
asked 11 minutes ago -
Using Python
The variables x and y refer to numbers. Write a code segment
that prompts...
asked 25 minutes ago -
If
the coefficient of static friction between a box and the floor is
0.35 with what...
asked 28 minutes ago -
A die is designed to punch holes with a radius of 1.08 10-2 m in
a...
asked 33 minutes ago -
government can increase import through
a. export subsidies
b. tax breaks
c. increase import tax
d....
asked 33 minutes ago -
Draw the following in the proper skeletal structure or line
angle formula.
5,6,6-tribromo-3,8-dicyclopropyl-7-isopentyldodecane
asked 38 minutes ago -
Two blocks of masses m1 and m2 hang at the ends of a string that
passes...
asked 39 minutes ago -
Linear programming is an excellent technique yet is not applied
nearly enough in the “real world.”...
asked 48 minutes ago -
What three alkenes yield 3-methylpentane on catalytic
hydrogenation?
asked 48 minutes ago -
In JAVA Create a program with an array with the following
data:
50 12 31 76...
asked 50 minutes ago