Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Given the values: 20, 15, 5, 10, 30, 25, 35 a) Show the result of inserting the values above to a B+-Tree with order 3
Given the values: 20, 15, 5, 10, 30, 25, 35
a)
Show the result of inserting the values above to a B+-Tree with order 3 and the leaf nodes
can store up to 3 records. (hints: at most two values in an internal node)
(6 marks)
b)
Show the result of inserting the values above to a max-Heap.
(6 marks)
c)
Assume n records are stored, what is the Big-O of searching a value in max-Heap?
(2 marks)
d)
Discuss one advantage and one disadvantage of max-heap compared with Binary Search
Tree.
(4 marks)
6. [18 marks] Given the values: 20,15, 5, 10, 30,25,35 a) Show the result of inserting the values above to a Bt-Tree with order 3 and the leaf nodes can store up to 3 records. (hints: at most two values in an internal node) (6 marks) b) Show the result of inserting the values above to a max-Heap. (6 marks) c) Assume n records are stored, what is the Big-O of searching a value in max-Heap? (2 marks) d) Discuss one advantage and one disadvantage of max-heap compared with Binary Search Tree. (4 marks)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started