The following three are the traversal sequence for preorder, inorder and postorder of a binary tree. 1. 33 27 77 25 55 53 67 43 88 99 II. 99 55 27 33 25 77 88 43 53 67 III. 27 33 55 77 25 99 88 53 43 67 a) Analyse which one is preorder, inorder and postorder. Explain and show your work. b) Based on question 6, build the tree and answer the following questions: 1. What is the node of level 1 left subtree ii. What is the node of level 1 right subtree iii. List all parents with only right leaf iv. List all leaves of the tree

The following three are the traversal sequence for preorder, inorder and postorder of a binary tree. 1. 33 27 77 25 55 53 67 43 88 99 II. 99 55 27 33 25 77 88 43 53 67 III. 27 33 55 77 25 99 88 53 43 67 a) Analyse which one is preorder, inorder and postorder. Explain and show your work. b) Based on question 6, build the tree and answer the following questions: 1. What is the node of level 1 left subtree ii. What is the node of level 1 right subtree iii. List all parents with only right leaf iv. List all leaves of the tree

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

hi, can you solve this question please ? thanks.
Question 4 Full explain this question and text typing work only thanks
Consider the tree structure given below. First complete the tree by replacing the question marks by some capital letters (A B … Z) as you like, so it becomes a binary search tree. Then complete the table below with the order in which the nodes (of the tree you completed) are visited with respect to the given traversals. Note: Do not change the tree structure. But it is totally up to you how you complete the tree as far as it is a binary search tree.
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.
13 46 65 58 84 94 98 Node 84 is to be removed from the above BST Tree. The first step is to find the rightmost node of 84. How will you find it? and What is the rightmost node of 84?
(a) Give ranks to each of the nodes below: (b) What is the type of the above tree?
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?
Dont use others answers! will rate! THANK YOU! Although you can uniquely construct a binary tree from either its preorder and inorder traversals or its postorder and inorder traversals, more than one binary tree can have the same preorder traversal and the same postorder traversal. Draw two different binary trees in the SIMPLEST case with the same preorder and postorder traversals.
The height of a tree is equal to the number of its nodes, thus how many nodes can there be in a binary tree that is 5 levels tall if a 1-node tree has a height of 1?
please question 11
Binary Tree and Binary Search Tree. Reconstruct a binary tree based on its pre-order traversal and its in-order traversal Pre-order: 12, 5, 2, 9, 18, 15, 13, 17, 19 In-order: 2, 5, 9, 12, 13, 15, 17, 18, 19
The following questions are based on a binary search tree in Figure Q2. 20 15 33 60 2 7 55 70 Figure Q2 (a) Which one is the root? (b) List all leaves. (c) Name each ancestor of the node that contains 15. (d) Name parent of 33.