i have asked this question before but the handwritting is unclear and i cant understand it will. Can you please type it out instead if you guys give the answer.thank you! Question 1a) Write an algorithm, flipTree (TreeNode: root), that flips a given input tree suchthat it becomes the mirror image of the original tree. For example:318228163You can assume, a class TreeNode with the basic methods such as getLeft(),getRight(), setLeft(), setRight(), and getValue() have been implemented andyou can make use these methods to implement your solution.b) Starting with an empty 2-4 tree, construct a 2-4 tree with the followingkeys. Show the major working steps.26, 24, 23, 25, 28, 27

What is a Binary Tree? A binary tree is a data structure that arranges objects in a tree with each…

a) Write an algorithm, flipTree (TreeNode: root), that flips a given input tree such that it becomes the mirror image of the original tree. For example: 3 6 1 8 2 4 4 2 8 1 6 3 You can assume, a class TreeNode with the basic methods such as getLeft(), getRight(), setLeft(), setRight(), and getValue() have been implemented and you can make use these methods to implement your solution. b) Starting with an empty 2-4 tree, construct a 2-4 tree with the following keys. Show the major working steps. 26, 24, 23, 25, 28, 27

a) Write an algorithm, flipTree (TreeNode: root), that flips a given input tree such that it becomes the mirror image of the original tree. For example: 3 6 1 8 2 4 4 2 8 1 6 3 You can assume, a class TreeNode with the basic methods such as getLeft(), getRight(), setLeft(), setRight(), and getValue() have been implemented and you can make use these methods to implement your solution. b) Starting with an empty 2-4 tree, construct a 2-4 tree with the following keys. Show the major working steps. 26, 24, 23, 25, 28, 27

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Assume we have an IntBST class, which implements a binary search tree of integers. The field of the class is a Node variable called root that refers to the root element of the tree. Write a method, using recursion or a loop, that returns the smallest element in the tree.
7 4 2 4 2 Tree #1 1 5 Tree #2 6 3 6 8 8 9 5 7 9 1 For parts a through g, implement the given method and demonstrate the method working with the two trees provided earlier. All code implemented in this assignment should be in a class called Homework 6. You may use the data structures and algorithm code from the lecture notes. Hint: Consider using recursion. To do so implement a private helper method that takes a Node and then recursively calls itself to traverse the tree. The public method would call the private method passing the tree's root as the Node.
Answer the given question with a proper explanation and step-by-step solution. Write a recursive method(Code ) static void mirrorTree(node root) This will take a tree as input and then change the tree such that it becomes a mirror of itself. We have the following methods implemented(you can use them and assume we coded somewhere else): getLeft(), getRight(), setLeft(), setRight(), getValue(). All the values in a node are integers. [Hint: Use them, and think how you would write when the tree only has 2 children ] Example:
To class Tree, add the following method public int countLeavesParent(){ return countLeavesParent(root); { Write the recursive method countLeaveParent(Node node) which returns how many internal nodes in that are parent of a leave.
Write a method isBST() that takes a Node as argument and returns true if the argument node is the root of a binary search tree, false otherwise.Hint : This task is also more difficult than it might seem, because the order in which youcall the methods in the previous three exercises is important.Write a method isBST() that takes a Node as argument and returns true if the argument node is the root of a binary search tree, false otherwise.Hint : This task is also more difficult than it might seem, because the order in which youcall the methods in the previous three exercises is important.
Build a Node class. It is should have attributes for the data it stores as well as its left and right children. As a bonus, try including the Comparable module and make nodes compare using their data attribute. Build a Tree class that accepts an array when initialized. The Tree class should have a root attribute that uses the return value of #build_tree which you'll write next. Write a #build_tree method that takes an array of data (e.g. [1, 7, 4, 23, 8, 9, 4, 3, 5, 7, 9, 67, 6345, 324]) and turns it into a balanced binary tree full of Node objects appropriately placed (don't forget to sort and remove duplicates!). The #build_tree method should return the level-1 root node. Write an #insert and #delete method which accepts a value to insert/delete. Compile and submit your source code and screenshots of the application executing the application and the results based in python. Your paper should be 2-3 pages in length (not including title and references pages)
Write a recursive method(Code ) static void mirrorTree(node root) This will take a tree as input and then change the tree such that it becomes a mirror of itself. We have the following methods implemented(you can use them and assume we coded somewhere else): getLeft(), getRight(), setLeft(), setRight(), getValue(). All the values in a node are integers. [Hint: Use them, and think how you would write when the tree only has 2 children ] Example:
You are creating from scratch a binary search tree class with the methods insert, find, and delete in addition to the method getRandomNode(), which retrieves a random node from the tree. There should be an equal chance of selecting each node. Create a getRandomNode algorithm, put it into practise, and describe how you'd develop the other functions.
Assume we have an IntBST class, which implements a binary search tree of integers. The field of the class is a Node variable called root that refers to the root element of the tree. Write a recursive method that prints all of the leaves, and only the leaves, of a binary search tree.
JAVA Write a recursive buildBinaryTree method that builds a new binary tree from the contents of an arraythat contains integers. Use the following class definition for a node in a binary tree:class BinaryNode{int element;BinaryNode left;BinaryNode right;}Hint: Take one item from the array and insert it as the root of the tree. Divide theremaining items in half and insert one half in the right subtree and the other half in theleft subtree of the root node by calling the method recursively with the relevant arrayindices.Note: You have to explain your method by means of inline comments or by including apseudo-code version of this method in comments. import test.BinaryNode; // BinaryNode class; stores a node in a tree. // // CONSTRUCTION: with (a) no parameters, or (b) an Object, // or (c) an Object, left child, and right child. // // *******************PUBLIC OPERATIONS********************** // int size( ) --> Return size of subtree at node // int height( ) --> Return height of…
Write a recursive buildBinaryTree method that builds a new binary tree from the contents of an arraythat contains integers. Use the following class definition for a node in a binary tree:class BinaryNode{int element;BinaryNode left;BinaryNode right;}Hint: Take one item from the array and insert it as the root of the tree. Divide theremaining items in half and insert one half in the right subtree and the other half in theleft subtree of the root node by calling the method recursively with the relevant arrayindices.Note: You have to explain your method by means of inline comments or by including apseudo-code version of this method in comments. import test.BinaryNode; // BinaryNode class; stores a node in a tree. // // CONSTRUCTION: with (a) no parameters, or (b) an Object, // or (c) an Object, left child, and right child. // // *******************PUBLIC OPERATIONS********************** // int size( ) --> Return size of subtree at node // int height( ) --> Return height of subtree…
The program BinaryTreeTest.java prints the nodes by inorder traversal. Please add two methods printPreOrder(Node node) and printPostOrder(Node node) in the program and print the numbers by the two orders. Then please add findMax(Node node)and findMin(Node node) to find the maximal and minimal numbers respectively for the tree. Hint: to implement findMax(Node node), a recursive method is needed. If the node is empty. return 0. If the node's right sub-tree is null, return the node's value. Otherwise call findMax() recursively using the right child as the parameter. findMin(Node node) is similar, but you will focus on left child.