Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
1. Write a SCHEME function, named (tree-size T), which takes a tree node, T, and returns the size (i.e. the number of nodes) of the tree rooted at T.

1. Write a SCHEME function, named (tree-size T), which takes a tree node, T, and returns the size (i.e. the number of nodes) of the tree rooted at T.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Answer using scheme language R5RS

Bmary Trees Recall the following code from the lecture slides: (define (make-tree value left right) (list value left right)) (define (value T) (car T)) (define (right T) (caddr T)) (define (left T) (cadr T)) 1. Write a SCHEME function, named (tree-size T), which takes a tree node, T, and returns the size (i.e. the number of nodes) of the tree rooted at T. 2. Write a SCHEME function named (tree-depth T) which takes a tree node, T, as a parameter and returns the depth of the tree rooted at T. For the purpose of this exercise, the depth of a tree rooted at T is one plus the maximum of the depths of its two children. 3. Define a SCHEMA function named (count-pred P tree) which given a binary tree and predicate function, P, applies the predicate to each of the values in the tree and returns the number of values for which the predicate returns #t (true). 4. Define a SCHEME function named count-one-child which returns the number of internal nodes of a binary tree which have exactly one child. Binary Search Trees (define (insert x T) (cond ((null? T) (make-tree x '() '())) ((eq? x (value T)) T) ((< x (value T)) (make-tree (value T) (right T))) (insert x (left T)) ((> x (value T)) (make-tree (value T) (left T) (insert x (right T))))))
Transcribed Image Text:Bmary Trees Recall the following code from the lecture slides: (define (make-tree value left right) (list value left right)) (define (value T) (car T)) (define (right T) (caddr T)) (define (left T) (cadr T)) 1. Write a SCHEME function, named (tree-size T), which takes a tree node, T, and returns the size (i.e. the number of nodes) of the tree rooted at T. 2. Write a SCHEME function named (tree-depth T) which takes a tree node, T, as a parameter and returns the depth of the tree rooted at T. For the purpose of this exercise, the depth of a tree rooted at T is one plus the maximum of the depths of its two children. 3. Define a SCHEMA function named (count-pred P tree) which given a binary tree and predicate function, P, applies the predicate to each of the values in the tree and returns the number of values for which the predicate returns #t (true). 4. Define a SCHEME function named count-one-child which returns the number of internal nodes of a binary tree which have exactly one child. Binary Search Trees (define (insert x T) (cond ((null? T) (make-tree x '() '())) ((eq? x (value T)) T) ((< x (value T)) (make-tree (value T) (right T))) (insert x (left T)) ((> x (value T)) (make-tree (value T) (left T) (insert x (right T))))))
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS