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? DS binary-search-tree data-structures zeal zeal2018 + – Anish Palan asked Dec 18, 2017 edited Mar 9, 2019 by ajaysoni1924 Anish Palan 720 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply hs_yadav commented Dec 18, 2017 reply Follow Share 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 votes 1 votes 92komal commented Dec 19, 2017 reply Follow Share plz explain properly i m not understand your answer 0 votes 0 votes Please log in or register to add a comment.
5 votes 5 votes this may Help you!! adikus1996 answered Aug 2, 2018 adikus1996 comment Share Follow See all 0 reply Please log in or register to add a comment.