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

2 votes135 views2 answers
Python check string for negative number
Python
0 vote131 views1 answer
Iterating over the two ranges simultaneously and saving it in database
Python
11 votes160 views3 answers
What is // in python
Python
12 votes156 views4 answers
Couldn't find a tree builder with the features you requested: lxml. Do you need to install a parser library?
Python
4 votes130 views2 answers
How to print time python
Python
1 vote126 views1 answer
Combining series to a dataframe
Python
0 vote127 views1 answer
Numpy array divide each row by its sum
Python
1 vote122 views1 answer
Program to find sum till n natural numbers in python
Python
0 vote153 views1 answer
Adding column to CSV Dictreader
Python
1 vote172 views1 answer
Django queryset multiple filters
Python Django