Zeal Test Series 2018: Programming & DS - Binary Search Trees

Question

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?

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!

---

plz explain properly i m not understand your answer

Answer 1

this may Help you!!