1 1 vote Programming in C + – ben10 1.9k views answer comment Share Follow Print See all 7 Comments 7 7 Comments reply Show 4 previous comments MiNiPanda commented Sep 2, 2018 reply Follow flag Yes as they wanted maximum so we should consider perfect BST 0 0 replyShare Mayankprakash commented Sep 3, 2018 reply Follow flag @MiniPanda Can you please explain your solution. As I couldn't solve. Thanks 0 0 replyShare MiNiPanda commented Sep 3, 2018 reply Follow flag @Mayankprakash See the answer in this post.. if you have doubt then ask. 0 0 replyShare Please log in or register to add a comment.
Best answer 2 2 votes for Maximum result we take Perfect Binary Search Tree If we take complete binary tree of height = 3 no of internal nodes = 7 Each internal node has 2 choices therefore , max No of BFS traversal = 2^7 Magma answered Sep 2, 2018 • edited Sep 3, 2018 by Magma Magma comment Share Follow See all 5 Comments 5 5 Comments reply Shaik Masthan commented Sep 3, 2018 reply Follow flag complete BST is some times not have more childrens, change it to Perfect Binary Search Tree in your solution,what is the significance of L = X(n-1) + 1 0 0 replyShare Magma commented Sep 3, 2018 i edited by Magma Sep 3, 2018 reply Follow flag Shaik Masthan done ! 0 0 replyShare Abbas commented Sep 3, 2018 reply Follow flag @Magma: Not getting your solution...can you explain it with example... 0 0 replyShare akash.dinkar12 commented Sep 3, 2018 reply Follow flag Shaik Masthan Can u give me some link where the definition of a complete binary tree or perfect binary tree or almost Complete binary tree or full tree are given ?? 0 0 replyShare Shaik Masthan commented Sep 3, 2018 reply Follow flag @akash.dinkar12 https://www.geeksforgeeks.org/binary-tree-set-3-types-of-binary-tree/ 0 0 replyShare Please log in or register to add a comment.
