edited by
471 views
0 votes
0 votes

Consider the below code which run on any tree.

  1. In-order traversal
  2. Post-order traversal
  3. Pre-order traversal
  4. None of these
edited by

1 Answer

Related questions

2 votes
2 votes
3 answers
1
0 votes
0 votes
0 answers
2
10 votes
10 votes
5 answers
3
Tushar Shinde asked Jan 18, 2016
4,022 views
The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?
1 votes
1 votes
2 answers
4
CHïntän ÞäTël asked Dec 10, 2018
977 views
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!