Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 8, Problem 31CRP
Design a nonrecursive
def Search(Tree, TargetValue):
if (Tree is None):
return None # Search failed
elif (TargetValue = = Tree.Value):
return Tree # Search succeeded
elif (TargetValue < Tree.Value):
return Search(Tree.Left, TargetValue)
# Apply the function Search to see if TargetValue is in the subtree identified by the root's left child pointer, and report the result of that search.
elif (TargetValue > Tree.Value):
return Search(Tree.Right, TargetValue)
# Apply the function Search to see if TargetValue is in the subtree identified by the ‘ right child pointer, and report the result of that search.
Figure 8.21
The binary search as it would appear if the list were implemented as a linked binary tree
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Path: p
Words:0
QUESTION 6
Draw the complete memoized recursive function tree for the Fibonacci Sequence using Dynamic Programming when n is 5.
Example (where # is the current value of n in a small recursive function tree)
f(#)
f(#) f(#)
TT T
3 (12pt)
Arial
Words:0
Path: p
Save All A
Click Save and Submit to save and submit. Click Saue All Answers to sove all ansuers.
1. Write a recursive function named RecursiveSum that, given a positive number n (n> 0), returns the sum of the numbers from 1 to n. Also, show the process of finding the result using a recursion tree.
please answer in scheme racket flavor
1. Create the recursive function far-left that will find the left-most value
2.Create the recursive function far-right that will find right-most value
3. Write depth, a procedure that takes a tree as an argument and returns the largest number of nodes connected through parent-child links. That is, a leaf node has depth 1; a tree in which all the children of the root node are leaves has depth 2. Our world tree has depth 4 (because the longest path from the root to a leaf is, for example, world, country, state, city).
4. Write count-nodes, a procedure that takes a tree as an argument and returns the total number of nodes in the tree. (Earlier we counted the number of leaf nodes.)
(define (leaf? node) (null? (children node))) (define (datum node) (car node)) (define (children node) (cdr node)) (define (count-leaves tree) (if (leaf? tree) 1 (count-leaves-in-forest (children tree)) ) ) (define (count-leaves-in-forest forest) (if (null? forest) 0 (+…
Chapter 8 Solutions
Computer Science: An Overview (12th 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
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Consider the adage Never ask a question for which you do not want the answer. a. Is following that adage ethica...
Experiencing MIS
(Invoice Class) Create a class called Invoice that a hardware store might use to represent an invoice for an it...
C How to Program (8th Edition)
3.12 (Date Create a class called Date that includes three pieces Of information as data
members—a month (type ...
C++ How to Program (10th Edition)
Available Credit A program that calculates a customers available credit should ask the user for the following: ...
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Explain the different aspects of the cost of a programming language.
Concepts of Programming Languages (11th Edition)
You cannot display the contents of the counter variable in the body of a loop.
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Recursive Functions 1. Without looking at the standard prelude, define the following library functions using recursion: o Decide if all logical values in a list are true: and [Bool] -> Bool o Concatenate a list of lists: concat: [[a]] -> [a] o Produce a list with n identical elements: replicate :: Int -> a => [a] o Select the nth element of a list: (!!) [a] -> Int -> a o Decide if a value is an element of a list: elem: Eq a => a => [a] -> Boolarrow_forwardDISCRETE STRUCTURE A game is played by moving a marker ahead either 2 or 3 steps on a linear path. Let cn be the number of different ways a path of length n can be covered. Given, Cn =Cn-2 + Cn-3, Ci=0, c2=1, c3=1 Write a recursive algorithm to compute Cn.arrow_forwardTrue/False 6. A sequence can be viewed as a recursive data collection.arrow_forward
- Implements the clone_node function that duplicates. If the node has a next it also duplicates it Hint: implement the following recursive pseudocode function clone_node(node) if node is NULL returns NULL returns new_node(node.value, clone_node(node.next)) Complete the code: def clone_node(node): r = <... YOUR CODE HERE ...> return rarrow_forward1. Recursion & List processing Write a recursive function flatten that takes a list as an argument and returns the flat version of that list. For example, (flatten '(a (b c) d)) -> (a b c d) (flatten '(((a)) (b (c)) d)-> (a b c d)arrow_forward1. Recursive Algorithm for Sequential Search(L,i,j,x)arrow_forward
- АСTIVITY 3 RECURSION Instructions: Use any size of bond paper. Write your name, course and year, date in your answer sheets. Use ALL CAPS. I. Recursion: Prove the following using recursion. 1. Ifg is defined recursively by g(0) = 3 and g(n + 1) = 2" – n. Find g(1), g(3), g(5), g(7) and g(9)arrow_forwardPart A: Maze exploration using recursive function (30%)A Maze is given as N*N binary matrix of blocks where source block is the upper leftmost block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N1][N-1]. A rat starts from source and has to reach the destination. The rat can move infour directions: left, right, up or down.In the maze matrix, 0 means the block is a dead end and 1 means the block can beused in the path from source to destination. Backtracking is an algorithmic techniquefor solving problems recursively by trying to build a solution incrementally in mazeexploration.Suggested Approach: Form a recursive function, which will follow a pathand check if the path reaches the destination or not. If the path does notreach the destination then backtrack and try other paths.Algorithm:1. Create a solution matrix, initially filled with 0’s.2. Create a recursive function, which takes initial matrix, output matrixand position of rat (i, j).3. if the position…arrow_forwardWhy does dynamic programming provide faster solutions that recursive algorithms solving the same problem? 1.avoids resolving overlapping subproblems 2.dynamic programming uses dynamic memory that is more efficient than stack memory 3.loops are always faster than recursion 4.dynamic uses arrays that are faster than function callsarrow_forward
- Design a top-down algorithm (based on dynamic programming and recursion; i.e. memory function) for checking the existence of a winning strategy for the “Rocks” game. Hints: • Give it the name: RocksMF(n,m) where n,m are the number of rocks on the two piles • Use recursion to call the algorithm itself to solve smaller subproblems • Use a global variable for the two-dimensional tablearrow_forward1. Give a recursive algorithm in pseudocode to compute the diameter of a binary tree. Recall that diameter is defined as the number of nodes on the longest path between any two nodes in the tree. Nodes have left and right references, but nothing else. You must use the height function, defined as follows, in your solution. Your solution will return the diameter of the tree as an integer. function height (Node n) 1. if n = null 2. return -1 3. return 1 + max (height (n.left), height (n.right)) Write your solution below. function diameter (Node n)arrow_forwardMazeSolver attempts to recursively traverse a Maze. The goal is to get from the * given starting position to the bottom right, following a path of 1’s. Arbitrary * constants are used to represent locations in the maze that have been TRIED * and that are part of the solution PATH.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License