Answered step by step
Verified Expert Solution
Question
1 Approved Answer
1 . Sequence of key - values ( 5 , 1 6 , 2 2 , 4 5 , 2 , 1 0 , 1
Sequence of keyvalues insert these keyvalues in the given order into the initially empty tree, and with respect to the finally obtained tree, which of the following descriptions is not true.
A There are nodes in total.
B the root node is the node of
C the incremental numbers can be obtained by traversing in the middle order.
D The height of the tree is
If you input a sequence of sorted data, and it takes On log n time to sort it using merge sort and heap sort, how much time will it take if you use insertion sort? What will be the result if this sorted data sequence is reversed?
A On On
B On log n On
C On On log n
D On log n On log n
Which of the following descriptions of BreadthFirst Search BFS is NOT true?
A It can be used to test whether a graph is connected or not.
B It can calculate whether there are loops in a graph.
C It takes time to visit On long n
D It can calculate the shortest path from the starting point to each vertex.
Consider a tree T storing n data items. If T is a binary search tree, what is the worstcase height of T
A n log n
B n
C n
D log n
Consider a tree T that stores n data items. If T is a splay tree, what is the worstcase height of T
A None of the above
B n log n
C log n
D n
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