a) The INORDER traversal output of a binary tree is M,O,T,I,V,A,T,I,O,N and the POSTORDER traversal output of the same tree is O,M,I,A,V,I,O,T,T,N. Construct the tree and determine the output of the PREORDER traversal output. b) One main difference between a binary search tree (BST) and an AVL (Adelson-Velski and Landis) tree is that an AVL tree has a balance condition, that is, for every node in the AVL tree, the height of the left and right subtrees differ by at most 1. Starting with an empty BST and AVL tree, insert the following keys into the two trees (BST as well as AVL trees): 17, 28, 10, 25, 27, 12, 32, 28 If a key is already existed, insert the new key to the right sub-tree. c) Based on what you have done for Question 3b, what is the big-O (worst case) complexity of the total time required to build a binary search tree (BST) consisting of n nodes? Explain your answer. Answer without explanation gains no mark. (Hint. A tricky question. The question asks for worst case complexity. Think properly.) d) Similarly, from what you have done for Question 3c, what is the big-o (worst case) complexity of the total time required to build an AVL tree consisting of n nodes? Explain your answer. Answer without explanation gains no mark. (Hint. The question asks for worst case complexity.)
a) The INORDER traversal output of a binary tree is M,O,T,I,V,A,T,I,O,N and the POSTORDER traversal output of the same tree is O,M,I,A,V,I,O,T,T,N. Construct the tree and determine the output of the PREORDER traversal output. b) One main difference between a binary search tree (BST) and an AVL (Adelson-Velski and Landis) tree is that an AVL tree has a balance condition, that is, for every node in the AVL tree, the height of the left and right subtrees differ by at most 1. Starting with an empty BST and AVL tree, insert the following keys into the two trees (BST as well as AVL trees): 17, 28, 10, 25, 27, 12, 32, 28 If a key is already existed, insert the new key to the right sub-tree. c) Based on what you have done for Question 3b, what is the big-O (worst case) complexity of the total time required to build a binary search tree (BST) consisting of n nodes? Explain your answer. Answer without explanation gains no mark. (Hint. A tricky question. The question asks for worst case complexity. Think properly.) d) Similarly, from what you have done for Question 3c, what is the big-o (worst case) complexity of the total time required to build an AVL tree consisting of n nodes? Explain your answer. Answer without explanation gains no mark. (Hint. The question asks for worst case complexity.)
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...
Related questions
Question
need help on this. Thanks in advance!
Transcribed Image Text:a) The INORDER traversal output of a binary tree is M,O,T,I,V,A,T,I,O,N and the
POSTORDER traversal output of the same tree is O,M,I,A,V,I,O,T,T,N. Construct the
tree and determine the output of the PREORDER traversal output.
b) One main difference between a binary search tree (BST) and an AVL (Adelson-Velski
and Landis) tree is that an AVL tree has a balance condition, that is, for every node
in the AVL tree, the height of the left and right subtrees differ by at most 1. Starting
with an empty BST and AVL tree, insert the following keys into the two trees (BST
as well as AVL trees):
17, 28, 10, 25, 27, 12, 32, 28
If a key is already existed, insert the new key to the right sub-tree.
c) Based on what you have done for Question 3b, what is the big-O (worst case)
complexity of the total time required to build a binary search tree (BST) consisting
of n nodes? Explain your answer. Answer without explanation gains no mark. (Hint.
A tricky question. The question asks for worst case complexity. Think properly.)
d) Similarly, from what you have done for Question 3c, what is the big-o (worst case)
complexity of the total time required to build an AVL tree consisting of n nodes?
Explain your answer. Answer without explanation gains no mark. (Hint. The question
asks for worst case complexity.)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 10 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY