1
Question
How many trees can be formed using 3 nodes
How many trees can be formed using 3 nodes
Open in App
Solution
The correct option is B 6
6 trees can be formed
using 3 nodes.
The root node has two children, each of which is an ordered tree with two elements. There are two ways we could order the two remaining nodes. So there are 3*2 = 6 possible
ordered trees with three nodes given that the root node has two children.
A tree is a widely used data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and sub trees of children with a parent
node, represented as a set of linked nodes.
6 trees can be formed using 3 nodes.
The root node has two children, each of which is an ordered tree with two elements. There are two ways we could order the two remaining nodes. So there are 3*2 = 6 possible ordered trees with three nodes given that the root node has two children.
A tree is a widely used data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and sub trees of children with a parent node, represented as a set of linked nodes.
Suggest Corrections
0
Similar questions