Register

MADE EASY PRACTICE TEST

512 views

1 Answer

0 0 votes
The resulting tree is like this :

                        2
                  2            3
               1            3
            1
Thus the level order traversal is   2,2,3,1,3,1.
Voting & Accepting an answer helps improve the community
← Previous · Choosing most suitab...Next → · MadeEasy Test Series...
← Previous in category · ME gate MOCK POSTFIXNext in category → · MadeEasy Test Series...
Position:
Show:

Related questions

1 1 vote
0 0 answers
444
444 views
srishtipandey420 asked Jul 4, 2024
444 views
made easy practice
the answer to the question is given as option c but when I am solving, it is coming as option a. Is the answer wrong? Am I solving incorrectly? Please confirmThe characte...
0 0 votes
1 answers 1 answer
683
683 views
srishtipandey420 asked Jun 20, 2024
683 views
made easy practice book
How can we solve this recurrance relation using master's theorem? T(n)=2 * T (n/2) + nlogn
0 0 votes
1 1 answer
602
602 views
Shankar Kakde asked Jan 25, 2019
602 views
Made Easy Practice Book
The number of labelled subgraph possible for the graph given below are ________.
0 0 votes
0 0 answers
887
887 views
Harsh Kumar asked Dec 11, 2018
887 views
DBMS, Made easy practice book
Can primary keys be updated using sql update query?Is such a query accepted/rejected?