Introduction to Trees (Binary Tree) in Python - A Simplified Tutorial

This tutorial explains how to implement binary trees in Python. In subsequent lessons, we would see how to implement:
Tree traversal using Breadth First Search(BFS) Algorithm
Tree Traversal using Depth First Search (DFS) Algorithm

Python Tutorials here

Data Science Tutorial

[hendrag]

Thanks Kindson, it is indeed a good video about tree creation in Python.

[zhoujenny]

here is the code:

class Node:
def __init__(self, data=None):
self.left = None
self.right = None
self.data = data

#set the root
def insert(self, data):
if self.data is None:
self.data = data
else:
if data < self.data:
if self.left is None:
self.left = Node(data)
else:
self.left.insert(data)

elif data > self.data:
if self.right is None:
self.right = Node(data)
else:
self.right.insert(data)


def PrintTree(self):
if self.left:
self.left.PrintTree()

print(self.data)

if self.right:
self.right.PrintTree()

root = Node("g")
root.insert("c")
root.insert("b")
root.insert("a")
root.insert("e")
root.insert("d")
root.insert("f")
root.insert("i")
root.insert("h")
root.insert("j")
root.insert("k")
root.PrintTree()

[cinward]

sorry but I think you are meant to order that tree according to the binary search tree? I don't get why you put BFS as the title unless we are doing some sort of tree traversal in this video. I might be wrong though

[rajeshchellappa]

This was very useful tutorial. Thanks for detailed explanation with python code.

[meilyn]

Thanks bro. I don't know if I understand better because of the Nigerian accent, but this helped a lot.

[juanjose]

How can I print it and see if it is in order?

[avid_traveler]

The first three lines in insert method is unnecessary. You can't initialize a Node without data.

[zurder]

any info about making a 2d visualization of a data tree? like printing the drawing on the left as the output of the code

[zhoujenny]

why does the output says AttributeError: 'NoneType' object has no attribute 'insert'?

[utkarsh]

i have a doubt in --" if data<self.data:
if self.left==None:
self.left =Node(data) "


we could have written: -- " self.left=data"
why Node(data) ??

[goodylili]

I seriously dont get the part where he says if data is less than self.data. Is that an arithmetic please

[hibamahmood]

thank you... informative video ... may I have your email to contact with you