You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
"DLS": "Depth-Limited search (DLS) is an algorithm for traversing or searching tree or graph data structures. It's actually specific type of DFS where the search is limited to some depth from start node (root). One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible (within some limit) along each branch before backtracking.",
"Complexity": {
"time": "worst $O(b^l)$",
"space": "worst $O(bl)$",
"notes" : "</br>b is branching factor, for example binary tree has branching factor 2 </br> l is limit that we define"
},
"References": [
"<a href='http://www.cs.colostate.edu/~anderson/cs440/index.html/doku.php?id=notes:week2b'>Colorado State University Lecture Notes</a>"
],
"files": {
"tree": "Searching a tree (limited depth)",
"count_descendant": "Count all descendant of root within some depth"