how to find the number of possible tree in the given tree.
Answer Posted / baskerdearer
number of possible tree = (2 power n) - n.
for example:
A tree contain three node.
so n=3.
possible tree = 8 - 3 = 5.
| Is This Answer Correct ? | 179 Yes | 26 No |
Post New Answer View All Answers
Does list maintain insertion order?
Can you use Bubble Sort To sort the number of elements.
There is a program which inserts and deletes node in a sorted singly linked list. There is a bug in one of the modules, how would you debug it?
Define depth and height of a node?
Which sorting method is slowest?
How arraylist increase its size?
What is array and its types in data structure?
Can we add duplicate keys in a hashmap? What will happen if we attempt to add duplicate values?
What is the need for priority queue?
Does hashmap preserve insertion order?
What is sequential sorting?
Explain the Array
Define terminal nodes in a tree?
What is time complexity of bubble sort?
Is hashmap fail safe?