in DS edited by
549 views
0 votes
0 votes
Given an initially empty Binary search tree how many different order of insertion order A,B,C,D,E,F,G that returns minimum height tree?
in DS edited by
549 views

2 Comments

minimum height would be when tree will be balanced...

means D must be root...

insertion order ...D (BFany order=2!) (ACEG any order 4!)...total different input order for height ..2 is 4!*2!

1
1
plz explain properly i m not understand your answer
0
0

1 Answer

4 votes
4 votes

this may Help you!!