4.
BINARY SEARCH TREE
Pre-Order: Root - Left - Right
45 12 5 34 18 40 50
Post-Order: Left - Right - Root
5 18 40 34 12 50 45
Removed 45: Find it and replace it with the highest value in the left sub tree
ADDED 42: Find the place of the 42 using BST rules and insert.
--------------------------------------
Hit the thumbs up if you are fine with the answer. Happy
Learning!
1. In Lab 4, you developed a program to build a Max Heap, and then Heap Sort. Update the program by adding two additional functions: (a) AddData(A, N, V) where V is the new value added. (b) Delete a data Delete by giving the index of the data position Make sure to display the array after calling each of the function. 2. Write a program to implement Binary Search Algorithm, which will return the index of the data searched (V)....
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...
I need question 9-10 answered. Thank you
Question 1 iShow the resulting binary search tree if we are to insert following elements into the tree in given order, [34, 12, 23, 27,31,9,11,45, 20, 37. i) Show the resulting balanced binary search tree if we are to insert following sorted elements into the tree, [9,12,21, 23, 29, 31, 34, 45, 48, 52, 55] iii What is the pre-order traversal of the balanced binary search tree? v) What is the post-order traversal...
1. Consider the following unordered list: 20, 35, 25, 10, 40, 50, 45. Perform heap sort to sort this list in nondecreasing (ascending) order. a. Perform the bottom-up method to arrange these values into a max heap. Show the heapify operations on each relevant subtree. (10 points) b. Show the tree representation and the array representation of these numbers after every dequeue operation. Remember that dequeue does not delete a number. Dequeue will instead remove that number from the heap...
Assignment on Java programing 1. Write programs for the following exercises in Java. Each file should have short description of the implemented class and for files with main method the problem it is solving. Make sure your files have appropriate names. Programs should write output to the Console. b) BST: Implement Binary Search Tree ADT with insert(int key), delete(int key), Node find(int key), and in-order traverse() where it prints the value of the key. Your operations should use recursion. The...
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...
17) Which of the following is a valid binary search tree? 23 12 40 19 30 61 13 21 41 50 23 43 10 18 34 51 15 21 40 50 23 43 10 18 51 15 27 40 50 What is the worst-case runtime of searching for a value in a binary search tree? (a) constant O(1) (b) logarithmic O(logn) (c) linear O(n) 18) Pag
(b) Given the following tree (graph) as shown in Figure 2: Diberi pepohon (graf) seperti yang ditunjukkan dalam Rajah 2: Figure 2 Rajah 2 (i) Find the pre-order traversal of the tree. Cari penyusuran pepohon "pre-order". (8/100) (ii) Find the post-order traversal of the tree. Cari penyusuran pepohon "port-order". (8/100) (iii Using the ordering c, d, e, f, g, h, i, j, k, I, m, a, b, c and the depth-first search algorithm, find a spanning tree for the graph...
Question II - Graph Traversal and Minimum Spanning Trees [40 Points] Consider the following graph: B 10 1 4 1 H 9 4 a) Traverse the graph starting from vertex A, and using the Breadth-First Search algorithm. Show the traversal result and the data structure you are using. [10 Points] b) Traverse the graph starting from vertex A, and using the Depth-First Search (Post-order) algorithm. Show the traversal result and the data structure you are using. [10 Points] c) Apply...
1.) Consider the binary search tree create by inserting the following values in the ordered given to create the binary search tree [20, 15, 45, 13, 25], what is the order that the nodes will be accessed using the inorder traversal. a. 20, 15, 45, 13, 25 b. 13, 15, 25, 45, 20 c. 13, 15, 20, 25, 45 d. None of the above. 2.) What C++ operation is used to de-allocate memory space? a. deallocate b. new c. delete...