Register

GATE CSE 2002 | Question: 6

• edited by
2,557 views
20 votes
20 votes
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.
• edited by
User Avatar

1 Answer

Best answer
25 votes
25 votes

$5$ Binary trees.

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

25 votes
25 votes
6 answers
2
Kathleen asked Sep 15, 2014
14,787 views
GATE CSE 2002 | Question: 1.5
In the worst case, the number of comparisons needed to search a single linked list of length $n$ for a given element is $\log n$ $\frac{n}{2}$ $\log_2 {n} - 1$ $n$
In the worst case, the number of comparisons needed to search a single linked list of length $n$ for a given element is$\log n$$\frac{n}{2}$$\log_2 {n} - 1$$n$
User Avatar
18 votes
18 votes
2 answers
3
Arjun asked Nov 7, 2014
3,399 views
GATE CSE 2002 | Question: 5b
Determine whether each of the following is a tautology, a contradiction, or neither ("$\lor$" is disjunction, "$\land$" is conjunction, "$\rightarrow$" is implication, "$\neg$" is negation, and "$\leftrightarrow$" is biconditional ( ... $(A \lor B) \rightarrow B$ $A \land (\neg (A \lor B))$
Determine whether each of the following is a tautology, a contradiction, or neither ("$\lor$" is disjunction, "$\land$" is conjunction, "$\rightarrow$" is implication, "$...
User Avatar
Link Copied!