The number of possible ordered trees with three nodes A,B,C is?

Related MCQs

• 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
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• 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?