1 votes
1 answer
2
Suppose there are $11$ nodes in a binary tree. Find the number of unlabeled binary trees if the number of nodes either in the left sub tree or in the right sub tree is di...
3 votes
1 answer
4
A FA accepting language L(A) has n states and m transition. ∑ = {a, b}L(A) is given asL(A)={ x | if x ∊ L(A) then u ∊ L(A) for $∃u, v ∊ ∑^{*}$ where x=uv }Fin...
1 votes
2 answers
5
How many min heap possible with 6 distinct node?