1. Given the BST tree below, fill in the values in the table. 0002 0005 0017 0005 0021 Height of tree 0025 Property 0034 0033 0040 Height of node 45 Depth of node 17 Node 76 degree Tree degree Name the nodes in left subtree of node 98 Order of tree Internal path length External path length 0043 0045 0045 0040 Value 0055 0067 0071 0076 0078 0084 0087 0002 0098 0000

1. Given the BST tree below, fill in the values in the table. 0002 0005 0017 0005 0021 Height of tree 0025 Property 0034 0033 0040 Height of node 45 Depth of node 17 Node 76 degree Tree degree Name the nodes in left subtree of node 98 Order of tree Internal path length External path length 0043 0045 0045 0040 Value 0055 0067 0071 0076 0078 0084 0087 0002 0098 0000

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

4. Draw the binary search tree whose root node is the 7th and 8th digit of your id i.e. ID: 2221078842, the root node is 88, and elements are inserted in the following order. 52 75 93 97 105 28 13 11 9 2 10 25 19 54 16 18 95 Print the elements of the tree after deleting nodes 9, 2, 25. Now insert new nodes 22, 100 and print the elements in the tree (postorder). [Just write the main.cpp must use the class included in your final syllabus to solve this problem]
Question 15 Use the Binary Search Tree (BST) deletion algorithm to delete 0074 from the BST below. List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 65 33 25 47 52 50 88 74 80 77 91 0065 0033 0088 0025 0047 0074 0091 0052 0080 0050 0077
List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 50 33 80 77 85 3. 0050 2 0033 0080 1 0077 0085
Question 14 Use the Binary Search Tree (BST) insertion algorithm to insert 0051 into the BST below. List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 65 33 25 47 52 50 88 74 80 77 0065 0033 0088 0025 0047 0074 0052 0080 0050 0077
10. The following keys are added to an AVL tree: 50, 25, 80, 35, 20, 3, 2, 17, 18, 37, 36 Print the nodes with preorder traversal. If needed, draw the AVL tree also for partial credit. 25 25 17 3 20,37 35 60 36 80 20
3. Given the binary tree, please describe the Inorder traversal algorithm and output the binary tree's Inorder traversal sequence. 10 1 40 1 20 1 1 50 30
Question 7 Use the Binary Search Tree (BST) deletion algorithm to delete 0065 from the BST below. List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 65 33 25 47 52 50 88 74 80 77 91 0065 033 0088 0025 0047 0074 0091 0052 0080 0050 0077 身

Question 16 Consider the AVL Tree below. Use the AVL Tree Insertion algorithm to add 99 to the tree. List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 66 22 30 77 70 92 85 98 4 0066 3 0022 0077 11 0030 0070 0092 1 0085 0098 2]
What is the minimum and maximum height of a binary tree with 10 nodes?
Problem 3. Binary Tree Q4. Given the binary tree on the picture, match the following questions with the answers. If you cannot see the picture, please look at the pdf file BinaryTree.pdf posted under Files/Final. 1 3 4 5 What is the root? 6 7 8 How many nodes in the tree? How many leaves in the tree? 12 9 What is the height of the tree? 15 10 13 17 [Choose ] [Choose ] [Choose ] [Choose ] > > <
i. ii. Using an array-based representation of a binary tree, the following array represents a binary tree. 0 1 2 3 59 39 75 4 48 5 6 70 80 111. Draw the binary tree that is represented by the above array. 7 8 9 10 11 12 13 14 44 68 90 What is the postorder traversal of the binary tree that is created in (i). What is the parent of 72?
Question 17 Consider the AVL Tree below. Use the AVL Tree Deletion algorithm to delete 0030 from the tree. List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 66 22 30 77 68 79 88 0066 2 3 0022 0077 11 0030 0068 0079 1 0088