MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Quantitative Aptitude

Number of Zeroes in a Number

The number of...

Question

The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is?

A

3

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

9

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

7

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

5

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

E

None of these

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is D 5
Five trees are

Suggest Corrections

thumbs-up

10

Similar questions

Q. Let PRE, IN, POST, LVL denote the preorder, postorder, inorder and level order traversal respectively. Then which of the following combinations of traversals is not sufficient to uniquely construct a binary tree?

Q. Consider a binary tree, where for every node P -

Q \leq 2

, where P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such a binary tree of height h = 4 will be

Q. The number of nodes in a full binary tree of depth 4 is

Q. The maximum number of nodes in a binary tree of depth K is

Q. A weight balanced tree is a binary tree in which for each node, the number of nodes in left subtree is at least half at most twice the number of nodes in the right subtree. The maximum possible height of such a tree on n nodes is best described by which of the following?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Highest Power and Summation

QUANTITATIVE APTITUDE

Watch in App

explore_more_icon

Explore more

Number of Zeroes in a Number

Other Quantitative Aptitude

Join BYJU'S Learning Program

CrossIcon