- Computer Science Engineering (CSE)
- Data Structures (DS)
- The number of possible ordered trees wit...

Q. |
## The number of possible ordered trees with three nodes A,B,C is? |

A. | 16 |

B. | 12. |

C. | 10 |

D. | 6 |

Answer» B. 12. |

View all MCQs in:
Data Structures (DS)

- trees are B-trees of order 4. They are an isometric of trees.
- What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
- In a full binary tree if number of internal nodes is I, then number of nodes N are?
- Why to prefer red-black trees over AVL trees?
- The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
- In a full binary tree if number of internal nodes is I, then number of leaves L are?
- Entries in a stack are “ordered”. What is the meaning of this statement?
- What is the best case and worst case complexity of ordered linear search?
- Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if
- What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

Login to Continue

It will take less than 2 minutes

Report MCQ