Homework Answers
a- logn + 10000 - answer is O(logn n)
b-nlog n + 15n + 0.0002n^2 answer is O(n^2)
c-100000n^2 + 16n + 2^n answer is O(n^2)
d-n + (n-1) + (n-2)+ - - - - 3 + 2 +1 = n(n+1)/2 which is n^2 +n/2
so answer is O(n^2)
e- 2^10 + 3^5 = O(1)
the image in the first image
is not clear so cannot provide the tree traversals, if you can
provide a clear image I can provide the answer for those as
well.
Add Answer to:
Data structure and algorithms
6112 pointsj One of the importast operations on a RST is to...
Prob. 3. Given the following data 50 40 23 36 19 20 9 a) Is this...
Prob. 3. Given the following data 50 40 23 36 19 20 9 a) Is this a max heap, draw the tree and check if this is a max heap. b) Illustrate how you would add a new data 46 to the existing maxheap. c) From the answer obtained in part b, illustrate how you would delete the data 40 d) Now illustrate heap sort with the existing data after step c. Give steps, and find runtime. Runtime|Explanation of Algorithm...
1. Short Questions Given the following data: 30 20 s0 40 10 60 28 Which method...
1. Short Questions Given the following data: 30 20 s0 40 10 60 28 Which method will perform better: Binary Search or Binary Search Tree? a) Give explanation as well S pts) b) Draw a binary search tree using the following data (5 pts) (No need to show the steps) 24 60 17 40 S0 20 22 21 c) Give the In-onder, pre-order and post-order search ordering from the tree constructed in part (b) (5 pts) d) Give definition of...
Data structures Exercises: For the following binary tree (Index-Value): 0 1 2 3 4 5 6...
Data structures Exercises: For the following binary tree (Index-Value): 0 1 2 3 4 5 6 7 8 9 A C E G B P D X F H Give the pre-order traversal. Give the post-order traversal. Give the in-order traversal. Determine the height of the tree. Using these values: 8 6 4 3 5 9 2 1 6 Build a binary search tree. Build an AVL Tree. Build a 2-3 Tree. Build a min-heap. Build a max-heap. Apply a...
Please show that the code is working at the end. Your program should read from the standard input...
Please show that the code is working at the end. Your program should read from the standard input a sequence of integer values, with each value separated by a space. Your task is to: Build a binary search tree using these values in the order they are entered. Print 3 traversals: pre-, in-, and post-order. Allow the user to insert/delete a value. Once a new tree is generated, print it in-order. Find predecessor of a given value. The predecessor is...
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...
I need help with this code, I'm stuck on it, please remember step 4, I'm very...
I need help with this code,
I'm stuck on it, please remember step 4, I'm very much stuck on
that part. It says something about putting how many times it
appears
Assignment #1: Sorting with Binary Search Tree Through this programming assignment, the students will learn to do the following: Know how to process command line arguments. 1 Perform basic file I/O. 2. Use structs, pointers, and strings. Use dynamic memory. 3. 4. This assignment asks you to sort the...
Please answer this programming question as fast as possible. Will upvote 45 pts Question 2 Let...
Please answer this programming question as fast as possible.
Will upvote
45 pts Question 2 Let BSTree be the following class which implements Binary Search Tree (BST). a. (5 points) Write the method public int maxElement 0 that returns the element of the tree with maximum value if the BST is not empty and returns -1 otherwise. b. (10 points) Write the method public void preOrderPrint 0 that prints out all the elements in the BST in the order of...
Please use C++ as a Programming language and do the tasks specified per the Guideline above...
Please use C++ as a Programming language and do the
tasks specified per the Guideline above and include comments of
your work.
Please make sure that the following test cases are
working:
Example 1
For input D13 D60 D76 D12 A17 D98 A94 D70 D3 A23 A42 D45 A100 D50
A99 A22 A87 A4 A90 D88 A71 A20 D39 D83 A97 A56 D28 A9 D43 A19 D5
A11 A54 A73 D54 A9 A24 A58 D6 D80 A72 A47 A82 A12...
SCREENSHOTS OF CODE ONLY!! PLEASE DON'T POST TEXT!! C++ CODE! PLEASE DON'T REPOST OLD POSTS! Objective...
SCREENSHOTS OF CODE ONLY!! PLEASE DON'T POST TEXT!! C++ CODE! PLEASE DON'T REPOST OLD POSTS! Objective To gain experience with the operations involving binary search trees. This data structure as linked list uses dynamic memory allocation to grow as the size of the data set grows. Unlike linked lists, a binary search tree is very fast to insert, delete and search. Project Description When an author produce an index for his or her book, the first step in this process...
First, read the article on "The Delphi Method for Graduate Research." ------ Article is posted below...
First, read the article on "The Delphi Method for Graduate Research." ------ Article is posted below Include each of the following in your answer (if applicable – explain in a paragraph) Research problem: what do you want to solve using Delphi? Sample: who will participate and why? (answer in 5 -10 sentences) Round one questionnaire: include 5 hypothetical questions you would like to ask Discuss: what are possible outcomes of the findings from your study? Hint: this is the conclusion....
Prob. 3. Given the following data 50 40 23 36 19 20 9 a) Is this a max heap, draw the tree and check if this is a max heap. b) Illustrate how you would add a new data 46 to the existing maxheap. c) From the answer obtained in part b, illustrate how you would delete the data 40 d) Now illustrate heap sort with the existing data after step c. Give steps, and find runtime. Runtime|Explanation of Algorithm...
1. Short Questions Given the following data: 30 20 s0 40 10 60 28 Which method will perform better: Binary Search or Binary Search Tree? a) Give explanation as well S pts) b) Draw a binary search tree using the following data (5 pts) (No need to show the steps) 24 60 17 40 S0 20 22 21 c) Give the In-onder, pre-order and post-order search ordering from the tree constructed in part (b) (5 pts) d) Give definition of...
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...
I need help with this code,
I'm stuck on it, please remember step 4, I'm very much stuck on
that part. It says something about putting how many times it
appears
Assignment #1: Sorting with Binary Search Tree Through this programming assignment, the students will learn to do the following: Know how to process command line arguments. 1 Perform basic file I/O. 2. Use structs, pointers, and strings. Use dynamic memory. 3. 4. This assignment asks you to sort the...
Please answer this programming question as fast as possible.
Will upvote
45 pts Question 2 Let BSTree be the following class which implements Binary Search Tree (BST). a. (5 points) Write the method public int maxElement 0 that returns the element of the tree with maximum value if the BST is not empty and returns -1 otherwise. b. (10 points) Write the method public void preOrderPrint 0 that prints out all the elements in the BST in the order of...
Please use C++ as a Programming language and do the
tasks specified per the Guideline above and include comments of
your work.
Please make sure that the following test cases are
working:
Example 1
For input D13 D60 D76 D12 A17 D98 A94 D70 D3 A23 A42 D45 A100 D50
A99 A22 A87 A4 A90 D88 A71 A20 D39 D83 A97 A56 D28 A9 D43 A19 D5
A11 A54 A73 D54 A9 A24 A58 D6 D80 A72 A47 A82 A12...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago