Access time of a binary search tree may go worse in terms of...

MCQ

Access time of a binary search tree may go worse in terms of time complexity upto

?(n2)

?(n log n)

?(n)

?(1)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What are double and single threaded trees?

when both left, right nodes are having null pointers and only right node is null pointer respectively

having 2 and 1 node

using single and double linked lists

using heaps and priority queues

Discussion

MCQ

After applying the below operations on a input sequence, what happens?

i. construct a cartesian tree for input sequence

ii. put the root element of above tree in a priority queue

iii. if( priority queue is not empty) then

.search and delete minimum value in priority queue

.add that to output

.add cartesian tree children of above node to priority queue

constructs a cartesian tree

sorts the input sequence

does nothing

produces some random output

Discussion

MCQ

What are the operations that could be performed in O(logn) time complexity by red-black tree?

insertion, deletion, finding predecessor, successor

only insertion

only finding predecessor, successor

for sorting

Discussion

MCQ

In which traversal, the root node is visited after the traversal of its left subtree and before the traversal of its right subtree?

Pre-order traversal

In-order traversal

Post-order traversal

Level-order traversal

Discussion

MCQ

What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

checkSum(struct bin-treenode *root , int sum) :
  if(root==null)
    return sum as 0
  else :
     leftover_sum=sum-root_node-->value
     //missing

code for having recursive calls to either only left tree or right trees or to both subtrees depending on their existence

code for having recursive calls to either only left tree or right trees

code for having recursive calls to either only left tree

code for having recursive calls to either only right trees

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics