Register

MadeEasy Test Series 2018: Programming & DS - Binary Tree

• edited by
727 views
0 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

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Equivalent FDsNext → · Which of the followi...
← Previous in category · link listNext in category → · Which of the followi...
Position:
Show:

Related questions

2 2 votes
3 3 answers
1.6k
1.6k views
Shamim Ahmed asked Dec 26, 2018
1,586 views
MadeEasy Test Series: Programming & DS - Binary Tree
1 1 vote
2 2 answers
2.0k
2.0k views
CHïntän ÞäTël asked Dec 10, 2018
1,997 views
MadeEasy Subject Test 2019: Programming & DS - Binary Tree
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!
0 0 votes
0 0 answers
741
741 views
sunaina rawat asked Nov 7, 2017
741 views
MadeEasy Subject Test: Programming & DS - Binary Tree
Consider programint foo(struct node *tree){if(tree==0)return 0;int lh=ht(tree->left);int rh=ht(tree->right);int ld=foo(tree->left);int rd=foo(tree->right);return max(lh+r...
0 0 votes
1 1 answer
632
632 views
sushmita asked Mar 26, 2017
632 views
MadeEasy Subject Test: Programming & DS - Binary Tree