Question Discussion & Solution

MCQ

A binary tree of depth

Each leaf in the tree is either at level

For any node

Both a and b

None of the above

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The number of nodes in a complete binary tree of level 5 is

Discussion

MCQ

Traversing a binary tree first root and then left and right subtrees called _______traversal.

inorder

preorder

postorder

none of these

Discussion

MCQ

What are the disadvantages of normal binary tree traversals?

there are many pointers which are null and thus useless

there is no traversal which is efficient

complexity in implementing

improper traversals

Discussion

MCQ

The property of binary tree is

The first subset is called left subtree

The second subtree is called right subtree

The root cannot contain NULL

The right subtree can be empty

Discussion

MCQ

Worst case efficiency of binary search is

log2 n + 1

log n.

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