please complete #2dont use others answersthank you! 1. Given the tree BST below, fill in the values in the table.0007000400120002000600090019000300050008001100150020PropertyValue3Height of treeHeight of node 82Depth of node 91Node 6 degreeTree degree00090008Name the nodes in left subtree ofnode 1200112Order of tree8Internal path length3External path length2. Perform the traversals on the above tree.a) preorder:b) inorderc) postorder:d) reverse postorder:

Note: Answering the 2nd question as per the instruction. Task : Given the Binsry Search Tree. Find…

1. Given the tree BST below, fill in the values in the table. 0007 0004 0012 0002 0006 0009 0019 0003 0005 0008 0011 0015 0020 Property Value 3 Height of tree Height of node 8 Depth of node 9 1 Node 6 degree 2 Tree degree 0009 Name the nodes in left subtree of node 12 0008 0011 Order of tree 8 Internal path length External path length 2. Perform the traversals on the above tree. a) preorder: b) inordet c) postorder: d) reverse postorder:

1. Given the tree BST below, fill in the values in the table. 0007 0004 0012 0002 0006 0009 0019 0003 0005 0008 0011 0015 0020 Property Value 3 Height of tree Height of node 8 Depth of node 9 1 Node 6 degree 2 Tree degree 0009 Name the nodes in left subtree of node 12 0008 0011 Order of tree 8 Internal path length External path length 2. Perform the traversals on the above tree. a) preorder: b) inordet c) postorder: d) reverse postorder:

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

Please draw the following:Form a binary tree with the root node holding 20, the left and right child of the node holding 20 respectively holding 75 and 43. The next level nodes hold the data 84, 90, 57 and 71 from left to right. The node holding 84 has left and right children that respectively hold 96 and 91 and the node holding 90 has a left child that holds 93.
If, for each node n, the heights of the subtrees of n deviate by no more than one, the tree is said to be an AVL tree or height balanced. Provide a static BinaryTree function that checks the height balance of a tree rooted at the specified node.
Answer the following questions about treeB. a. What is the height of the tree? b. Which nodes are on level 3? c. Which levels have the maximum number of nodes that they could contain? d. What is the maximum height of a binary search tree containing these nodes? Draw such a tree. e. What is the minimum height of a binary search tree containing these nodes? Draw such a tree. f. What is the order in which the nodes are visited by an ignorer traversal? g. What is the order in which the nodes are visited by a preorder traversal? h. What is the order in which the nodes are visited by a postorder traversal?
Please written by computer source Consider the following B tree of minimum degree t = 3. The root node contains the following keys: 3 30 65 and four pointers to child 1, child 2, child 3 and child 4. Child 1 contains two keys 1 2 child 2 contains three keys 4 5 6 child 3 contains two keys 40 50 child 4 contains five keys 70 80 82 84 92 Show the B-tree after deleting key 2. You present your B-tree in the same format as given in the question.
Insert the following key values one by one into an empty AVL tree. Restore tree as needed during the process. After the tree is built, show the post order traversal result in terms of the order of the key values visited. 30 45 65 55 50 52
According to the following requests, please draw the operations procedure of binary search tree as step by step. Note: The deletion of double child nodes adopts the left subtree uniformly Input: 53, 82, 77, 37, 26, 45, 87, 18, 66, 12, 84, 79 Delete: 12, 77 Input: 58, 23, 51, 16, 95, Delete: 53
a.What are the siblings of node homeworks/? b.Which nodes are in the subtree rooted at node projects/? c. What is the depth of node papers/?d. What is the height of the tree?
Given the following binary tree in the picture (where nullptr height == -1):A. What is the height of the tree?B. What is the depth of node 90?C. What is the height of node 90?D. Give the pre-order, in-order, and post-order traversal of this tree
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes is O(na logbn). Then the value of a + 10b is.
Draw a tree with a depth of 3 and indicate all the nodes as either a parent, child, root, or leaf node(s). (2.)The in-order and pre-order traversals of a binary tree is given as CBEDFHGAJI and HBCDEFAGIJ respectively, draw the binary tree.
1. A binary tree of height h has at least h nodes and at most ______ nodes. (a) 2h (b) 2h (c) 2h+1 (d) 2h– 1 2. (True or False) A binary tree of n nodes has exactly n – 1 edges 3. Pre-order traversal is also called______. (a) Depth first (b) Breadth first (c) Level order (d) In-order 4. Total number of nodes at the nth level of a binary tree can be given as (a) 2n (b) 2n (c) 2n+1 (d) 2n–1
Given a binary search tree built to store data records, to determine the height of a subtree rooted at a particular node N in the tree, the________traversal method should be used. Question 12 options: postorder any order inorder preorder