Question Discussion & Solution

MCQ

The pre-order traversal of a binary-search tree is DBACFE. What is the post-order traversal?

ABFCDE

ADBFEC

ABFEDC

ACBEFD

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

In a full binary tree if number of internal nodes is I, then number of leaves L are?

L = 2I

L = I + 1

L = I

L = 2I

Discussion

MCQ

Worst case time complexity of binary search is ______________

O(n)

O(logn)

?(nlogn)

?(logn)

Discussion

MCQ

Worst case efficiency of binary search is

log2 n + 1

log n.

Discussion

MCQ

In order to get the contents of a Binary search tree in ascending order, one has to traverse it in

pre-order

in-order

post order

not possible

Discussion

MCQ

A binary tree of depth "d" is an almost complete binary tree if

for any node

each leaf in the tree is either at level

both (a) and (b)

None of these

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