0 votes 0 votes shouldn't be the max size of array [ 2^n - 1] when the binary tree will be one side only.....and minimum "n" when it will be either full binary tree or complete binary tree? Algorithms algorithms array binary-tree test-series + – Prateek kumar asked Jan 16, 2017 • retagged Jul 13, 2022 by makhdoom ghaya Prateek kumar 397 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply IamRishabh commented Jan 17, 2017 reply Follow Share whats the answer????? i am unable to get the concept.. 0 votes 0 votes Prateek kumar commented Jan 17, 2017 reply Follow Share the answer is "A"...simplify log // 2^log(base2)n =n 0 votes 0 votes IamRishabh commented Jan 17, 2017 reply Follow Share ohhh okay okay .. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes answer will be b) think for a right skewed tree Psy Duck answered Aug 24, 2022 Psy Duck comment Share Follow See all 0 reply Please log in or register to add a comment.