2 votes 2 votes If we backtrack in DFS ,then doesn't statement 1 becomes true ? Graph Theory depth-first-search + – Pawan Kumar 2 asked Jan 13, 2018 Pawan Kumar 2 487 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Pawan Kumar 2 commented Jan 14, 2018 reply Follow Share ans was given F T 0 votes 0 votes hs_yadav commented Jan 14, 2018 reply Follow Share @pawan if question is asked that...number of time a node would be pushed in to stack then that is ....1 for BFS.... and I think here question is about number of times a node pushed in stack.....therefro second is true... u can take a example and check urself..... 1 votes 1 votes Kaluti commented Mar 1, 2018 reply Follow Share answer should be false, true 0 votes 0 votes Please log in or register to add a comment.
