0 votes 0 votes Maximum number of BFS Traversal Possible on BST of height 3 is .......... Programming in C breadth-first-search algorithms data-structures + – Na462 asked Oct 21, 2018 • recategorized Jul 6, 2022 by Lakshman Bhaiya Na462 1.0k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply MiNiPanda commented Oct 21, 2018 reply Follow Share 26 ? 0 votes 0 votes Hardik Vagadia commented Oct 21, 2018 reply Follow Share How? Should'nt it be 2^3? 0 votes 0 votes Deepanshu commented Oct 21, 2018 reply Follow Share 2^7 0 votes 0 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes 27 ways Magma answered Oct 21, 2018 • selected Oct 22, 2018 by Na462 Magma comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments srestha commented Oct 21, 2018 reply Follow Share BFS start from root or from hight 0 then how can u start a BFS traversal from leaf? 0 votes 0 votes Magma commented Oct 21, 2018 reply Follow Share Somoshree Datta 5 difference between graph and tree traversal is deciding where to start searching! In a tree traversal, we always start with the root node, and, for BFS, work our way down through the tree structure, level by level. But, when dealing with a graph, there is not obvious start, since there is no concept of a “root” node. Graph traversal can begin with any vertex in the graph, so we’ll choose one arbitrarily. 0 votes 0 votes Somoshree Datta 5 commented Oct 22, 2018 reply Follow Share oh..ok..I didnt know that bfs on trees had this restriction..thanks :) 0 votes 0 votes Please log in or register to add a comment.
