0 votes
2
$/* abc */Printf("what's \ up \ \%d",++ \&\& *a);$
0 votes
3
1) (L/a)a=L(the left side represents the concatenation of the languages L/a and {a})2) a(a/L)=L(again concatenation with {a},this time on the left,is intended)3) ...
0 votes
5
If the inorder traversal and preorder traversal of a binary tree having N elements are given, then what will be the time complexity of post order traversal and level orde...