Draw binary tree diagrams for each of the following Scheme expressions: '(1 2 3 4 5)...

Question

Question

Draw binary tree diagrams for each of the following Scheme expressions:

'(1 2 3 4 5)
'(1 (2 (3 (4 (5)))))
'(((((1) 2) 3) 4) 5)
'((1 2) ((3 4) ((5 6))))
'((()) ((()) ()))

engineering Computer-Science

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

Data structures Exercises: For the following binary tree (Index-Value): 0 1 2 3 4 5 6...

Data structures Exercises: For the following binary tree (Index-Value): 0 1 2 3 4 5 6 7 8 9 A C E G B P D X F H Give the pre-order traversal. Give the post-order traversal. Give the in-order traversal. Determine the height of the tree. Using these values: 8 6 4 3 5 9 2 1 6 Build a binary search tree. Build an AVL Tree. Build a 2-3 Tree. Build a min-heap. Build a max-heap. Apply a...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw...

3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw the trees that result from the following operations: (a) Inserting 142, 400, 205, 127, 100, 320, 160, 141, and 110 into an initially-empty tree (in that order). (b) Deleting 142 from the tree you drew for part (a). 4. (8 points) Draw the unique binary tree that has a preorder traversal of 4, 1, 6, 3, 7, 5, 9, 2, 8 and an inorder...
Draw a maximally balanced binary search tree that can be produced from the elements: 1, 2,...

Draw a maximally balanced binary search tree that can be produced from the elements: 1, 2, 3, 4, 5, 6, 7, 8, 9. Hint: a maximally balanced binary search tree minimises the average depth of its elements.

(CO 7) Evaluate the value of the following Scheme expressions. 1. (* 4 5) 2. (+...

(CO 7) Evaluate the value of the following Scheme expressions. 1. (* 4 5) 2. (+ 1 5 3) 3. (+ 2 (- 6 3)) 4. ((LAMBDA (x) (* x x x)) 2) (CO 5) What are the arguments for and against the C++ policy on inlining of methods? (CO 6) Explain why allowing a class to implement multiple interfaces in Java and C# does not create the same problems that multiple inheritance in C++ creates. (CO 8) Describe how...
a) Create a binary search tree with the 4 2 2 0 1 4 5 9...

a) Create a binary search tree with the 4 2 2 0 1 4 5 9 7 1 5 3 6 number. b) Provide the Preorder, Inorder and Postorder traversal of tree obtained in part (a). Show all the steps.
ALGORITHM AND DATA STRUCTURES Question Question 1: Convert the following binary tree into a heap using...

ALGORITHM AND DATA STRUCTURES Question Question 1: Convert the following binary tree into a heap using the Heapify algorithm. Draw the diagrams of the tree step by step after every alteration. Question 2: Show the heap that results when the items are inserted into the heap one by one, starting with one that is empty. 7, 3, 8, 1, 4, 20, 11, 33, 45, 23, 6 Question 3. Draw the 2-3-4 tree that results when values are inserted in the...

Consider the following max-heap stored as an array: <7, 6, 4, 2, 5, 1, 3>. Draw...

Consider the following max-heap stored as an array: <7, 6, 4, 2, 5, 1, 3>. Draw this max-heap as an (undirected) binary tree and give both adjacency-list representation and adjacency-matrix representation of the binary tree
Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers ke...

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers keys in post-order - Retrieve the integers keys in pre-order - Draw a binary search tree after node 58 is deleted b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that...
Starting with an empty binary search tree, insert each of the following keys and rotate it...

Starting with an empty binary search tree, insert each of the following keys and rotate it to the root in the specified order: 6 1 18 7 15 Starting with an empty red-black binary search tree, insert the following keys in order:: 12 5 23 9 19 2 21 18 7 Show the tree immediately after you insert each key, and after each time you deal with one of the book's cases 1, 2, or 3 (that is, if dealing with one case leads to another, show the additional case as a...

Tree Plot Please write a Java program to print or plot a binary tree in a 2-dimensional character format. You are not...

Tree Plot Please write a Java program to print or plot a binary tree in a 2-dimensional character format. You are not allowed to use any existing Java classes such as ArrayList or Vector or Tree. Your program must define 3 binary trees as follows. Each tree is defined in an integer 16 x 3 array. Programming Techniques: (1) The array for the binary tree can be integer data type with 16 rows by 3 columns. Please always make index...