Problem 9 Given a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). levelOrder: 'a tree -> 'a list list Example: Given a treet: the returned result of levelOrder t should be a nested list [[41]; [20;65]; [11; 29; 50;91]; [32; 72; 99]]. The i th elment of the nested list is a list of tree elements at the i th level of the tree t from left to right. You may need to define a recursive auxiliary function. Note: OCaml queues are mutable first-in-first-out (FIFO) data structures, and hence are not functional. Since our goal is to practice functional programming, please do not use OCaml queues for this assignment. You may find the List.mapi function particularly useful. In [] let levelOrder t = (* YOUR CODE HERE *) In [] assert (levelOrder (construct [41; 65; 20; 11;50;91; 29;99; 32;72]) = [[41]; [20;65]; [11; 29; 50;91]; [32; 72; 99]])

Problem 9 Given a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). levelOrder: 'a tree -> 'a list list Example: Given a treet: the returned result of levelOrder t should be a nested list [[41]; [20;65]; [11; 29; 50;91]; [32; 72; 99]]. The i th elment of the nested list is a list of tree elements at the i th level of the tree t from left to right. You may need to define a recursive auxiliary function. Note: OCaml queues are mutable first-in-first-out (FIFO) data structures, and hence are not functional. Since our goal is to practice functional programming, please do not use OCaml queues for this assignment. You may find the List.mapi function particularly useful. In [] let levelOrder t = (* YOUR CODE HERE *) In [] assert (levelOrder (construct [41; 65; 20; 11;50;91; 29;99; 32;72]) = [[41]; [20;65]; [11; 29; 50;91]; [32; 72; 99]])

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

1. Show the result of inserting 3, 1, 4, 6, 9, 2, 5, 7 into an initially empty binary search tree. a.) Given the tree in (1), show the result of deleting the root
Suppose a BST contains the integer values 1 through 15 and is a perfect binary tree. a) Draw the tree. b) Suppose we call the removeViaReplace method, with r equal to the root of the tree in Part a. List the numbers in child->value at the beginning of each iteration of the while loop in the code below. After that, redraw the tree upon completion of the removeViaReplace function. c) Repeat Part b, but use the tree obtained at the end of Part b as the initial tree this time. static void removeViaReplace(Node* r) { Node* temp = r->right; if (temp->left == nullptr) { r->value = temp->value; r->right = temp->right; delete temp; } else { Node* child = temp->left, * parent = temp; while (child->left != nullptr) { parent = child; child = child->left; } r->value = child->value; parent->left =…
Please provide code in Python Language design algorithms for the following operations for a binary tree T: preorder next(p): Return the position visited after p in a preorder traversal of T (or None if p is the last node visited). inorder next(p): Return the position visited after p in an inorder traversal of T(or None if p is the last node visited).
Show the result of inserting 30, 10, 40, 60, 90, 20, 50, 70 into an initially empty binary search tree. b) Is the above tree a full binary tree? Why? Why not? c)Draw the subtree with the root node as 60.
Construct a Binary Search Tree (BST) using the data provided in shaded row and name it “BST-1”. 50 45 65 60 75 90 15 35 70 45 55 40 20 80 95 85 25 50 74 5 Provide answers to the following considering your constructed BST-1: Write a C++ code that finds and delete a node having exactly two Childs in a BST. Simulate your code on BST-1 and provide a step-by-step procedure to delete “15” and “75” from it.
PLease do A,B, and C Given the following tree: A.Is the tree balanced? If not, where is the tree out of balance? B.Is it a BST? If not, where is the violation of the search tree order? C.Show the order the nodes will be visited in a preorder, inorder, and postorder traversal. Be sure to clearly indicate which traversal is which.
Given a binary tree, design an algorithm which creates a linked list of all the nodesat each depth (e.g., if you have a tree with depth D, you'll have D linked lists).
Given the traversals, please draw a Binary Tree. thankss b. PostOrder: GKHDBLIEJMFCAInOrder: GDKHBAELICJFM
For a binary tree, the pre-order traversal is H D A C B G F E the in-order traversal is: A D C B H F E G (A) Draw this binary tree (B) Give the post-order traversal
JAVA Create a binary tree from the given array. Provide a listing of the values for each node in the order they are traversed for norder, preorder, and postorder traversals. Clearly label your traversals. You do not need to submit the binary tree. [11, 20, 8, 16, 13, 10, 7, 12
For the given Binary Tree, list the keys in the order they are visited by each of the following traversal methods (a) Preorder (b) Inorder (c) Postorder
In a complete binary tree, every node save the last has precisely two children, and the deepest layer has all leaves with no "gaps". The tree is stagnant, with no new nodes. Reduce left and right pointers in a "normal" binary tree implementation?