6. (a) Draw the binary tree produced by inserting the following elements in a max-heap in the given order: 6, 11, 4, 3, 7, 15, 9, 12, 16 Insert each element, one at a time, and show the heap after each insertion. (b) List the elements of the array which represents the heap in problem 6a. List the elements in the order they appear in the array.

6. (a) Draw the binary tree produced by inserting the following elements in a max-heap in the given order: 6, 11, 4, 3, 7, 15, 9, 12, 16 Insert each element, one at a time, and show the heap after each insertion. (b) List the elements of the array which represents the heap in problem 6a. List the elements in the order they appear in the array.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

7. The following array contains a min-heap (a heap where each node is smaller than its children): 1 42 78 6 5 9 (a) Draw this heap in tree format. (b) Show the heap that results if you add 3 to it. Display the heap in both the array and tree formats. (c) Show the heap that results if you dequeue from the original heap (NOT the version from part (b)). Display the heap in both the array and tree formats.
3. () Suppose we create a binary search tree (BST) of numbers in this order: 6, 4, 9, 3, 5, 10, 2, 7, 8 Draw the binary search tree. Delete the node "9" in the tree. Redrawn the binary search tree.
3. In an array-based representation of a binary tree, what should be the maximum size of the array to accommodate the binary tree shown below? 35 / \ 17 20 65 \/\ 25 40 70 1 What is the maximum size of the array? (Write the formula) a. Draw the array with its index values and the items of the above binary tree inside that array. b. Write the order of the items visited in the above binary tree in Preorder traversal.
In Part c take 04 and 09 as last 2 digit
3. Draw the binary heap in its tree form from its array form: 0 1 2 3 4 5 6 7 8 9 10 11 12 2 3 4 9 10 17 15 11 9 13 22 20
B) What are the differences between array and linked list. C) What is meant by Binary Search Tree, (1) construct a binary tree by inserts the given values: (35, 33, 50, 10, 60, 22, 17, 48, 92,55,7). (2) Insert 58, 25 respectively (3) Delete 92, 35.
(2.2) Consider the sequential representation of binary trees. Construct the binary tree represented by the array shown in Table 1. Table 1: Question 2.2 1 F 2 D 3 4 5 E 6 A 7 H 8 C 9 K 10 11 12 J B 13 14 15 M G
Q.No.3 a) Which array out of A, B and C represents a 0 1 2 3 4 10 11 binary heap? Only one answer is right. A. 1 12 23 10 15 38 45 15 18 20 21 b) Write the heap out as a binary tree. 0 1 2 3 4 5 7 8 9 10 11 91 c) Add last 2 digit of your arid no(Take 7 and B- 18 27 10 45 83 91 31 12 52 51 2). to the heap, making sure to restore the 1 2 3 4 5 7. 6. 10 11 C. 1 13 20 21 65 54 67 41 30 83 52 heap invariant. How does the array look now?
b. Given the array representation of a binary tree (null value means the node is empty]: [null, P, T, X, null, S, Q, U, null, null, Y, W, R, null, null, VM i. Draw the binary tree. [2]
Exercise #2 Draw the binary tree that has the following preorder and inorder and postorder traversals. Inorder sequence: D, B, E, A, F, C, G Preorder sequence: A, B, D, E, C, F, G Postorder sequence: D, E, B, F, G, C, A Exercise #3 сл Add 12 to the following max heap
Computer Science Binary Search Tree Implement Binary search Tree (BST) and perform the following operations a. Insert the keys 11,66, 6,9,40,28,5, 88,125,90 b. Print the keys in sorted order using suitable traversal method. C. Search for a key x and prints its address if it is present. d. Compute height of the BST e. Print successor/predecessor of a given key f. Delete the keys 40 and 88 one by one and print the tree in level order after each delete. Note: use only recursive functions for all the operations. Write the c code with proper comments.
1. Suppose you have these inputs: M, I, T, Q, L, H, R, E, K, P, C, A. a. Show the binary search tree for these inputs. b. Show how to store the binary search tree in an array with the node structure (key, left, right).