Python depth first search

# left to right, pre-order depth first tree search, recursive. O(n) time/space
def depthFirstSearchRec(root):
    if root == None: return
    print(root)
    depthFirstSearch(root.left)
    depthFirstSearch(root.right)

Similar codes

0 vote253 views1 answer
How to create a numpy array with constant value
Python
1 vote275 views1 answer
Stack overflow python ip check
Python
0 vote253 views1 answer
Python: if null give a value if not null concatenate
Python
2 votes210 views1 answer
Discord.py username input in numbers
Python
0 vote225 views1 answer
Row to column python numpy
Python
1 vote269 views2 answers
Permutation of a string in python
Python
-1 vote249 views1 answer
How to make take command in python
Python
4 votes243 views1 answer
Print specific list item python
Python
1 vote248 views1 answer
How to give multiple option to the user and ask the same question again and again until the user tells one of the options
Python
0 vote262 views2 answers
How to round to 3 significant figures in python
Python