Question Discussion & Solution

MCQ

What is the time complexity for finding the height of the binary tree?

h = O(loglogn)

h = O(nlogn)

h = O(n)

h = O(log n)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Average case time complexity of binary search is ______________

O(n)

?(nlogn)

O(logn)

?(logn)

Discussion

MCQ

The linked representation of a binary tree is implemented by using a linked list having an_________.

Info part

Two pointers- left and right

Both (a) and (b)

One pointer

Discussion

MCQ

The in order traversal of tree will yield a sorted listing of elements of tree in

Binary trees

Binary search trees

Heaps

None of above

Discussion

MCQ

What is inefficient with the below threaded binary tree picture?

it has dangling pointers

nothing inefficient

incorrect threaded tree

space is being used more

Discussion

MCQ

The depth of a complete binary tree is given by

Dn = n logn+1

Dn = logn

Dn = logn+1

Dn = n logn

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