edited by
720 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?
edited by

1 Answer