I'll add a new article to howcode.org tomorrow with some extra stuff I didn't have time to talk about in the video, it's a bit late for me at the moment! 🕑
class Node: def __init__(self,value,left = None ,right=None): self.value= value self.left = left self.right = right def __str__(self): return "Node("+str(self.value)+")" def walk(tree): if tree is not None: print(tree) walk(tree.left) walk(tree.right) def walk2(tree,stack): stack.append(tree) while len(stack) > 0: node = stack.pop() if node is not None: print(node) stack.append(node.right) stack.append(node.left) mytree = Node('A', Node('B',Node('D'),Node('E')), Node('C',Node('F'),Node('G'))) walk(mytree)
Why we are not having conditions to check whether the left and right are not none. It might reduce some iteration’s right. Correct me if I am wrong please
May be worth adding/mentioning a search term to your functions since these are searching algorithms. It may be obvious for some to just add an if-statement and return some value (i.e. boolean, Node), but definitely not all will know. Great video nonetheless!
Man, do more, someday I will learn English enough to watch all your videos !!! I will learn English for you and your fucking great content in the world. ahhhhhhhhhhhhhh....
I tried creating an empty list and pass it in the walk2 function but I got this error TypeError: 'builtin_function_or_method' object is not subscriptable any help? my code #the Stack stack = [] #calling walk2 function print("THE ITERATIVE WAY") walk2(mytree,stack)
I'll add a new article to howcode.org tomorrow with some extra stuff I didn't have time to talk about in the video, it's a bit late for me at the moment! 🕑
actually the best explaintion ive seen after hours of searching for explanations - very informative and easy to follow
Dude, I can't get over how easy it is to print the different orders by just moving the print statement. Thank you!
I have been looking for a easy to follow video on this for some time and finally I have found one. Thank you and keep up the good work!
class Node:
def __init__(self,value,left = None ,right=None):
self.value= value
self.left = left
self.right = right
def __str__(self):
return "Node("+str(self.value)+")"
def walk(tree):
if tree is not None:
print(tree)
walk(tree.left)
walk(tree.right)
def walk2(tree,stack):
stack.append(tree)
while len(stack) > 0:
node = stack.pop()
if node is not None:
print(node)
stack.append(node.right)
stack.append(node.left)
mytree = Node('A', Node('B',Node('D'),Node('E')), Node('C',Node('F'),Node('G')))
walk(mytree)
Thank you.
Also users will need to add stack = [] or stack = deque() to use walk2
Why we are not having conditions to check whether the left and right are not none. It might reduce some iteration’s right. Correct me if I am wrong please
Great video man! I really feel you made everything less complicated!
Glad you have posted again Francis
May be worth adding/mentioning a search term to your functions since these are searching algorithms. It may be obvious for some to just add an if-statement and return some value (i.e. boolean, Node), but definitely not all will know. Great video nonetheless!
Welcome back! This is interesting.
Cleanest explanation I've found. Well done!
Thank you! Very easy to understand for me!
Great explanation! Thank you.
Thank you for this! Best and simplest ive seen yet.
Please do python graphs and other data structures as well as algorithms
Man, do more, someday I will learn English enough to watch all your videos !!! I will learn English for you and your fucking great content in the world. ahhhhhhhhhhhhhh....
Can I get access to the code?
I tried creating an empty list and pass it in the walk2 function but I got this error
TypeError: 'builtin_function_or_method' object is not subscriptable
any help?
my code
#the Stack
stack = []
#calling walk2 function
print("THE ITERATIVE WAY")
walk2(mytree,stack)
Amazing explanation 😇
Thank you
Great video
What software you use for animation?
I make Keynote presentations and just record them 👍
No proper explanation of creating the nodes
Depth first search? Nah, I prefer bread search first
I'm so tired
Lol, "bread" search first