Computer Science An Overview Ap Edition
13th Edition
ISBN: 9780134891729
Author: J. Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 8, Problem 33CRP
Explanation of Solution
Nested Activation diagram for given
The nested activation diagram for recursive tree-printing algorithm is shown below:
Diagram Explanation:
- If “Tree” is “None”, then call the method “PrintTree(Tree.Left)”, then print the current root node value and then call method “PrintTree” with argument “Tree.Right”.
- Then again call the method “PrintTree(Tree.Left)”. This method check the “if” loop again...
Expert Solution & Answer
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Students have asked these similar questions
Use the recursive strategy described in the chapter to implement a binary tree. Each node in this method is a binary tree. Thus, a binary tree includes references to its left and right subtrees in addition to the element stored at its root.You could also wish to make mention of its progenitor.
Draw the diagrams of an 2-3 tree as the following items are inserted into an empty tree in the specified order: 8, 71, 90, 80, 84, 75, 76, 70, 10, 1, 2, 3, 4, 5, 6.
To simplify the diagrams, you only have to draw the diagrams before and after each split/promotion operation. If a split/promotion has to be done recursively, only draw the diagram after all recursive splits/promotions have been done.
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?
Chapter 8 Solutions
Computer Science An Overview Ap Edition
Ch. 8.1 - Give examples (outside of computer science) of...Ch. 8.1 - Prob. 2QECh. 8.1 - Prob. 3QECh. 8.1 - Prob. 4QECh. 8.1 - Prob. 5QECh. 8.2 - In what sense are data structures such as arrays,...Ch. 8.2 - Prob. 2QECh. 8.2 - Prob. 3QECh. 8.3 - Prob. 1QECh. 8.3 - Prob. 2QE
Ch. 8.3 - Prob. 3QECh. 8.3 - Prob. 4QECh. 8.3 - Modify the function in Figure 8.19 so that it...Ch. 8.3 - Prob. 7QECh. 8.3 - Prob. 8QECh. 8.3 - Draw a diagram representing how the tree below...Ch. 8.4 - Prob. 1QECh. 8.4 - Prob. 2QECh. 8.4 - Prob. 3QECh. 8.4 - Prob. 4QECh. 8.5 - Prob. 1QECh. 8.5 - Prob. 3QECh. 8.5 - Prob. 4QECh. 8.6 - In what ways are abstract data types and classes...Ch. 8.6 - What is the difference between a class and an...Ch. 8.6 - Prob. 3QECh. 8.7 - Suppose the Vole machine language (Appendix C) has...Ch. 8.7 - Prob. 2QECh. 8.7 - Using the extensions described at the end of this...Ch. 8.7 - In the chapter, we introduced a machine...Ch. 8 - Prob. 1CRPCh. 8 - Prob. 2CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 4CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 6CRPCh. 8 - Prob. 7CRPCh. 8 - Prob. 8CRPCh. 8 - Prob. 9CRPCh. 8 - Prob. 10CRPCh. 8 - Prob. 11CRPCh. 8 - Prob. 12CRPCh. 8 - Prob. 13CRPCh. 8 - Prob. 14CRPCh. 8 - Prob. 15CRPCh. 8 - Prob. 16CRPCh. 8 - Prob. 17CRPCh. 8 - Prob. 18CRPCh. 8 - Design a function to compare the contents of two...Ch. 8 - (Asterisked problems are associated with optional...Ch. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 22CRPCh. 8 - Prob. 23CRPCh. 8 - Prob. 24CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 26CRPCh. 8 - Prob. 27CRPCh. 8 - Prob. 28CRPCh. 8 - Prob. 29CRPCh. 8 - Prob. 30CRPCh. 8 - Design a nonrecursive algorithm to replace the...Ch. 8 - Prob. 32CRPCh. 8 - Prob. 33CRPCh. 8 - Prob. 34CRPCh. 8 - Draw a diagram showing how the binary tree below...Ch. 8 - Prob. 36CRPCh. 8 - Prob. 37CRPCh. 8 - Prob. 38CRPCh. 8 - Prob. 39CRPCh. 8 - Prob. 40CRPCh. 8 - Modify the function in Figure 8.24 print the list...Ch. 8 - Prob. 42CRPCh. 8 - Prob. 43CRPCh. 8 - Prob. 44CRPCh. 8 - Prob. 45CRPCh. 8 - Prob. 46CRPCh. 8 - Using pseudocode similar to the Java class syntax...Ch. 8 - Prob. 48CRPCh. 8 - Identify the data structures and procedures that...Ch. 8 - Prob. 51CRPCh. 8 - In what way is a class more general than a...Ch. 8 - Prob. 53CRPCh. 8 - Prob. 54CRPCh. 8 - Prob. 55CRPCh. 8 - Prob. 1SICh. 8 - Prob. 2SICh. 8 - In many application programs, the size to which a...Ch. 8 - Prob. 4SICh. 8 - Prob. 5SICh. 8 - Prob. 6SICh. 8 - Prob. 7SICh. 8 - Prob. 8SI
Knowledge Booster
Similar questions
- When iterating over a hierarchical data structure, such as a tree,Group of answer choices 1. Iterating must be done recursively and it must start at the root, visiting each node once. 2. Iterating must start at the children, and must be done with recursion. 3. Iterating starts at the root but can continue depth first or breadth first, and must be done recursively. 4. Iterating must start at the root and it must traverse nodes exactly once.arrow_forwardUse the recursive strategy described in the chapter to implement a binary tree. Each node in this method is a binary tree. Thus, a binary tree includes references to its left and right subtrees in addition to the element stored at its root. You could also wish to make mention of its progenitor.arrow_forwardCreate a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follows: //check pic// 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. Hints: 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…arrow_forward
- Assume there is a rooted tree A. Write a recursive program that returns both the number of nodes(N) and number of edges(E) in A.arrow_forwardCreate 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.arrow_forwardComputer Science 1. Implement this recursive method to evaluate an arithmetic expression represented as a tree. If exp.isConstant is true, only the value instance variable is set, whereas if ! exp.isConstant, the value instance variables is not set and the others (operator, left, right) are set. private class ENode { // invariants: boolean isConstant; // true for leaf nodes, false for operator nodes int value; // only has a value if isConstant char operator; // if ! isConstant, can only be '+' or '*' ENode left; // null if isConstant, not null otherwise ENode right; // null if isConstant, not null otherwise}public static int evaluate(ENode exp) { // YOUR CODE HERE}arrow_forward
- 24. What sequence of nodes from the tree A DEF G would be printed if the following recursive procedure were applied to it? def printTree (Tree): if (Tree is not None): printTree (Tree.Left) print (Tree.Value) printTree (Tree.Right)arrow_forward7 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.arrow_forwardConsider the following binary tree: (this is NOT a binary search tree) root 6 8 9 15 10 16 11 12 17 13 14 18 19 23 20 21 22 24 25 Suppose we implement contains(x) using the basic recursive traversal approach as a starting point. A private recursive helper method would look like static boolean helper (target, node) if node is null then return false if node.value== target then return true findLeft := helper (target, node.left) findRight := helper (target, node.right) return findLeft OR findRight If we call helper(3, root) (using the tree above), how many times is helper called in total (including this first call)? A ENG ☎ ♡ 3:25 PM 2022-04-28arrow_forward
- Write programs to do BFS and DFS traverse of the graph, based on the adjacent list structure. By using queue, implement the BFS algorithm and print the node sequence. By using recursive method, implement the DFS algorithm and print the node sequence. The source node of the traverse should be input by the user.arrow_forwardWrite a recursive programme that accepts a BST and an integer k as input and returns the tree's kth smallest node. Remember that the nodes in the left subtree are all smaller than the root, while those in the right are all bigger.arrow_forward4. Write a recursive algorithm in pseudocode that finds the lowest common ancestor (LCA) of two given nodes in a binary tree T. The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself). If either p or q is null, the LCA is null. For this problem, Nodes have left, right, and parent references as well as a field called level which stores the level of the node in the tree. In the sample tree below, node 5 is on level 0, while nodes 4 and 6 are on level 1. Write your solution here. 5 <- level 0 4 6 < level 1 function lowest_common_ancestor (Node P, Node q)arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education