Question: help!!! CSCI_2315 Homework8-Binary TreesName: This is 50-point Homework exercise that will be turned in before class on Tuesday, 28 November 2017. 1. (5 points) With
CSCI_2315 Homework8-Binary TreesName: This is 50-point Homework exercise that will be turned in before class on Tuesday, 28 November 2017. 1. (5 points) With a Balanced Binary Search Tree (aka. AVL Tree), what is the maximum number of comparisons required to find a search key in a 31-element array? Draw the tree 2. (5 points) What is the minimum number of nodes in a binary tree with L leaves? Draw at least two tress to convince me/yourself. 3. (5 Points )How many N node binary trees with items 1, 2, ..-, N have identical preorder and inorder traversals? Draw the tree 4. (5 points) Which of the following can be done in o(log N) time? Draw the tree, if necessary a. Find the height of a tree. b. Find the number of leaves in a tree. c. Find the number of full nodes. d. Finding the number of nodes with one child
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
