edited by
228 views
1 votes
1 votes

Consider the following nested representation of Binary Trees (ASD) where S and D are left and right subtrees of node A. Note that S and D may be NULL or further nested.

In this scenario, which of the following representation is a valid Binary Tree?

  1. $(12(4567))$
  2. $(1((234)56)7)$
  3. $(1(234)(567))$
  4. $(1(23 \text{NULL} )(45))$
edited by

1 Answer

Answer:

Related questions

0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
1,637 views
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest f...
1 votes
1 votes
3 answers
3
0 votes
0 votes
0 answers
4