Exercise 3 All parts of this question are based on the tree shown below: 20 34 16 24 55 a) What are four characteristics/types that one could call this tree below? (E.g. complete, perfect, etc.) b) Write the sequence of nodes visited in the tree using postorder traversal. c) Briefly elaborate the procedure that is carried out if node 11 is to be deleted.

Exercise 3 All parts of this question are based on the tree shown below: 20 34 16 24 55 a) What are four characteristics/types that one could call this tree below? (E.g. complete, perfect, etc.) b) Write the sequence of nodes visited in the tree using postorder traversal. c) Briefly elaborate the procedure that is carried out if node 11 is to be deleted.

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

Course : Data Structure and Algorithms Write a java/c++ code or an algorithm to solve the following problem. After that dry run and show output of algorithm using an example binary tree. . Write a recursive function to write the parent of the all the nodes while traversing. Like if you traverse the root node write the current node a, parent null. Then if you go to left sub tree, your code will show, current node : b , parent a and so on.
Question 5: Add Leaves Implement add_d_leaves, a function that takes in a Tree instance t and mutates it so that at each depth d in the tree, d leaves with labels v are added to each node at that depth. For example, we want to add 1 leaf with v in it to each node at depth 1, 2 leaves to each node at depth 2, and so on. Recall that the depth of a node is the number of edges from that node to the root, so the depth of the root is 0. The leaves should be added to the end of the list of branches. def add_d_leaves(t, v): """Add d leaves containing v to each node at every depth d. > > > t1 = Tree(1, [ Tree(3)]) > > > add_d_leaves(t1, 4) > > > t1 Tree(1, [Tree(3, [Tree(4)])]) > > > t2 = Tree(2, [Tree(5), Tree (6)]) > > > t3 = Tree(3, [t1, Tree(0), t2]) > > > add_d_leaves (t3, 10) > > > print(t 3) 3 1 3 4 10 10 10 10 10 10 0 10 2 5 10 10 6 10 10 10 """ def add_leaves(t, d): "*** YOUR CODE HERE **** add_leaves (t, 0)
12. How many recursive calls needed to build this perfect binary tree? Please show the detailed step by step calculation from the following recursive definition in the box. Base Case: If a single node has no children, it is a perfect binary tree of height h = 0 If a node has h> 0, it is a perfect binary tree if both of its subtrees are of height h- 1 and are non-overlapping or in other words- "If T is a perfect binary tree, then a new perfect binary tree T' can be constructed by taking two copies of T, adding a new vertex y and adding edges between v and the roots of each copy of T. The new vertex v is the root of T" 1. 2.
Computer Science Exercise: shape [★★★] Write a function same_shape : 'a tree -> 'b tree -> bool that determines whether two trees have the same shape, regardless of whether the values they carry at each node are the same. Hint: use a pattern match with three branches, where the expression being matched is a pair of trees. please use Ocaml for the coding
Problem Description Using the binary search tree (BST) data structure, we can sort a sequence of n elements by first calling an insertion procedure for n times to maintain a BST, and then performing an INORDER-TREE-WALK on the BST to output the elements in sorted order. To insert a node, we've discussed the TREE-INSERT procedure in class (also from page 294 of the text- book). This TREE-INSERT procedure can actually be improved to reduce the number of key comparisons so that each node's key is compared with the new node's key for at most once during each insertion. For example, given the following BST, The improved insertion procedure will make • 2 comparisons to insert a node with key = 1 • 3 comparisons to insert a node with key = 3 • 2 comparisons to insert a node with key = 8 5. Program Requirements In this programming assignment, you will implement in Java this sorting algorithm using BST, by using the improved insertion procedure. Note that each node of a BST is an object…
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You are given a tree — associated undirected chart without cycles. One vertex of the tree is exceptional, and you need to track down which one. You can pose inquiries in the accompanying structure: given an edge of the tree, which endpoint is nearer to the uncommon vertex, which means which endpoint's most brief way to the extraordinary vertex contains less edges. You need to track down the uncommon vertex by posing the base number of inquiries in the most pessimistic scenario for a given tree. If it's not too much trouble, note that the exceptional vertex probably won't be fixed by the interactor ahead of time: it may change the vertex to some other one, with the prerequisite of being steady with the recently offered responses. Input You are given an integer n (2≤n≤100) — the number of vertices in a tree. The folloiwing n−1 lines contain two integers every, u and v…
a) Write a program to construct a BST for a given set of key. b) Search a given key in a given BST. c) Traverse a BST in i) preorder, ii) inorder, iii) postorder. d) Delete a node from the tree with given key (node maybe i) leaf node, ii) it may have one child, iii) it may have two child) Code in C.
3. In a B*-tree, there can be at most 4 search-key values in each node. Assume that the height of the B*-tree is 2. The height of the tree is the length of the path from the root to a leaf node. a) What is the maximum number of leaf nodes this tree can have? Answer: b) Let N1 be a node in the tree. N1 is neither a leaf nor the root. What is the minimum number of children that N1 can have? Answer:
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.
Q2) Consider the following 50 25 12 90 18 65 100 60 70 a) Make a BST for the above data. b) What is the height of the BST? c) Show the output for in order, preorder and postorder traversal of the tree
In DrRacket: Define the difference between Binary Search Trees and Nodes? A) A Binary Search Tree is a Node, but a Node isn’t always a Binary Search Tree. B) A Node is a Binary Search Tree, but a Binary Search Tree isn’t always a Node. C) Binary Search Trees may contain Nodes, but Nodes cannot contain Binary Search Trees. D) Nodes may contain Binary Search Trees, but Binary Search Trees cannot contain Nodes. E) They are the same thing
Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow: You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree. Header file typedef char ElemType; typedef struct node//define the type of binary tree node { }BTnode; Source file #include <stdio.h> #include <stdlib.h> #include "tree.h" BTnode * createTree()//create the binary tree，return the root { BTnode *tnode;// tnode is the root char elem; ;//input the character //if the input is a space，set the pointer as NULL Else// if the input is not a space，generate the binary node and create its left sub-tree and right…