recategorized by
1,377 views

1 Answer

Best answer
1 votes
1 votes

A) False.

A tree with n nodes has n-1 edges.

B)False

With Postorder and preorder it's not possible to construct a binary tree.

C)False

Maximum number of nodes are 2^h -1

D)True

Full binary tree with n internal nodes have n+1 leaves.

selected by
Answer:

Related questions

0 votes
0 votes
0 answers
2
Sanjay Sharma asked Apr 25, 2018
5,942 views
Q Suppose T1(N) = O (f (N)) and T2(N) = O (f (N)).Which of the following statements are true in general? (a) T1(N) + T2(N) = O (f (n)) (b) T1(N) − T2(N) = o (f (n)) (c...
0 votes
0 votes
0 answers
3
shivanisrivarshini asked Feb 24, 2018
507 views
1. $L' = \sum^*−L$ for any language $L$2. $L=\{a^ma^nb^n\mid m>0 , n>0 \}$ is DCFL3. If a language is closed under complement,difference then it is closed under inters...