3 votes 3 votes In a binary tree, the time complexity of best upper and lower bound time required to get number of subtrees having exactly 8 nodes? DS binary-tree data-structures + – srestha asked Oct 14, 2017 srestha 455 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply sourav. commented Oct 14, 2017 reply Follow Share $O(n)$? 0 votes 0 votes Shubhanshu commented Oct 14, 2017 reply Follow Share Upper Bound O(n) Lower Bound O(logn) 0 votes 0 votes Diksha Aswal commented Nov 14, 2017 reply Follow Share can u explain.. how? 0 votes 0 votes smsubham commented Feb 17, 2018 reply Follow Share @sourav. @ Shubhanshu Can you explain? 0 votes 0 votes Please log in or register to add a comment.