c)An expression of A + B^3 – C/D is obtained using a rooted tree.i.Draw a rooted tree with the height of 2 to represent the postorder traversal.ii.Justify whether the rooted tree in 3-c(i) is balanced or not.iii.From tree in c(i), get the mathematical expression using the inorder traversal.d)Figure 3 represents a network of paths in a park. The number on each edge represents thelength of the path in meters. The cost per meter is RM120. To gain as much profit, thecontractor asked one of his staff to find the minimum network needed using Kruskal'salgorithm.G21161721F1123E1171518В 1120AFigure 3i.Explain why the staff's work which is highlighted in red is incorrect.ii.Help the staff to find the correct minimum network using Kruskal's algorithm andstates its length and total cost.iii.Is there any possibiliy, more than one distint MST obtained for the Figure 3?. If yes,justify your answer and show the network.

According to our guidelines we solve first one:…

=) An expression of A + B^3 – C/D is obtained using a rooted tree. i. Draw a rooted tree with the height of 2 to represent the postorder traversal. ii. Justify whether the rooted tree in 3-c(i) is balanced or not. iii. From tree in c(i), get the mathematical expression using the inorder traversal.

=) An expression of A + B^3 – C/D is obtained using a rooted tree. i. Draw a rooted tree with the height of 2 to represent the postorder traversal. ii. Justify whether the rooted tree in 3-c(i) is balanced or not. iii. From tree in c(i), get the mathematical expression using the inorder traversal.

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

C++, Write a recursion function that counts the positive elements multiple of 5 in a binary search tree and counts the elements less than 0 and multiple of 2, then returns the two counts multiplied to the main.Note that you have to write only one function and you can add parameters to the function as needed
in c++, write a function to find the height of a specific node in a Binary Search Tree.
Given the following infix expression: (28 * (33 - 3) + 10) / (4 * 0.5) % 4 Give the equivalent postfix expression Draw the tree corresponding to the recursive calls to evaluate the postfix expression. What is the depth of your tree?
C++ Recall that a "leaf" node in a binary tree is one which has no child nodes, and the height of a tree is the maximum number of edges from its root to one of its leaves). We also saw how easily a binary tree can become poorly structured, where the heights to various leaves in the tree vary dramatically. A full binary tree is one where each node other than the leaf nodes has two child nodes, Write a recursive function which returns true if a binary tree is full, false otherwise. Please avoid the use of variables declared outside of the function.
Computer Science Exercise: depth [★★] Write a function depth : 'a tree -> int that returns the number of nodes in any longest path from the root to a leaf. For example, the depth of an empty tree (simply Leaf) is 0, and the depth of tree t above is 3. Hint: there is a library function max : 'a -> 'a -> 'a that returns the maximum of any two values of the same type. please use Ocaml for the coding
Write a C++ code to insert the following information in the Binary Search Tree: {Paris, London, Dubai, Muscat, Riyadh, Berlin, Amsterdam, Sydney, Stockholm, Oslo} After insertion, print all names of binary search tree using cout statement.
Given the following expression trees, manually evaluate them. Show step by step solution.
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.
SOLVE THE MAZE FUNCTION USING STACK.PLEASE ONLY C CODE,DONT USE C++ AND C#. /* R\C 0 1 2 3 4 5 6 7 *//* 0 */ {0, 0, 0, 1, 0, 0, 0, 0},/* 1 */ {0, 1, 1, 1, 0, 0, 1, 0},/* 2 */ {0, 1, 0, 1, 0, 0, 1, 0},/* 3 */ {0, 1, 0, 1, 1, 1, 1, 0},/* 4 */ {0, 1, 0, 0, 0, 0, 1, 1},/* 5 */ {0, 1, 1, 0, 1, 1, 1, 0},/* 6 */ {0, 0, 0, 0, 1, 0, 0, 0},/* 7 */ {0, 0, 0, 0, 1, 0, 0, 0}, #include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef struct LINKED_STACK_NODE_s{LINKED_STACK_NODE next;void *data;} LINKED_STACK_NODE_t[1]; typedef struct LINKED_STACK_s{LINKED_STACK_NODE head;int count;} LINKED_STACK_t[1], *LINKED_STACK; typedef struct{int R;int C;} POS_t[1], *POS; LINKED_STACK stack_init();void stack_free(LINKED_STACK stack);void stack_push(LINKED_STACK stack, void *data);void *stack_pop(LINKED_STACK stack);void *stack_top(LINKED_STACK stack);int is_empty(LINKED_STACK stack); int is_empty(LINKED_STACK stack){return…
Solve the maze function using stack.PLEASE ONLY C CODE, DONT USE C++ AND C# . /* R\C 0 1 2 3 4 5 6 7 *//* 0 */ {0, 0, 0, 1, 0, 0, 0, 0},/* 1 */ {0, 1, 1, 1, 0, 0, 1, 0},/* 2 */ {0, 1, 0, 1, 0, 0, 1, 0},/* 3 */ {0, 1, 0, 1, 1, 1, 1, 0},/* 4 */ {0, 1, 0, 0, 0, 0, 1, 1},/* 5 */ {0, 1, 1, 0, 1, 1, 1, 0},/* 6 */ {0, 0, 0, 0, 1, 0, 0, 0},/* 7 */ {0, 0, 0, 0, 1, 0, 0, 0}, void solve_maze(){int M[8][8] = {/* R\C 0 1 2 3 4 5 6 7 *//* 0 */ {0, 0, 0, 1, 0, 0, 0, 0},/* 1 */ {0, 1, 1, 1, 0, 0, 1, 0},/* 2 */ {0, 1, 0, 1, 0, 0, 1, 0},/* 3 */ {0, 1, 0, 1, 1, 1, 1, 0},/* 4 */ {0, 1, 0, 0, 0, 0, 1, 1},/* 5 */ {0, 1, 1, 0, 1, 1, 1, 0},/* 6 */ {0, 0, 0, 0, 1, 0, 0, 0},/* 7 */ {0, 0, 0, 0, 1, 0, 0, 0},};int I, J, R = 0, C = 3;LINKED_STACK stack;POS pos = (POS)malloc(sizeof(POS));int flag;stack = stack_init(); do{// TODO: Fill this block.} while (R != 7 && C != 7 && R != 0 && C != 0);}int main(){solve_maze();return 0;}
Tree Traversal Use the following tree for the traversals in the next four question parts. Just list the values visited: a. Walk/print the tree in a Pre-order Depth First Traversal. b. Walk/print the tree in an In-order Depth First Traversal. c. Walk/print the tree in a Post-order Depth First Traversal. d. Walk/print the tree in a Breadth First Traversal.
Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow: //PICTURE// 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.