Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Data Structures
Recursion & Backtracking
Question
Medium
tcs-nqt
What is the space complexity of recursive DFS on a tree with height h?
A
O(n)
B
O(h)
C
O(1)
D
O(n×h)
Show Answer
← Back to Recursion & Backtracking questions
What is the space complexity of recursive DFS on a tree with height h? | Recursion & Backtracking MCQ | TomoLink | TomoLink
