-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbinaryTreeLinkedList.py
50 lines (32 loc) · 1.04 KB
/
binaryTreeLinkedList.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
from requests import post
class BinaryTreeLinkedList:
def __init__(self, data):
self.data = data
self.right_node = None
self.left_node = None
binaryTree = BinaryTreeLinkedList("Drinks")
left_child = BinaryTreeLinkedList("Hot")
right_child = BinaryTreeLinkedList("Cold")
binaryTree.left_node = left_child
binaryTree.right_node = right_child
def preOrderTraversal(treenode):
if not treenode:
return
print(treenode.data)
preOrderTraversal(treenode.left_node)
preOrderTraversal(treenode.right_node)
preOrderTraversal(binaryTree)
def inOrderTraversal(treenode):
if not treenode:
return
inOrderTraversal(treenode.left_node)
print(treenode.data)
inOrderTraversal(treenode.right_node)
inOrderTraversal(binaryTree)
def postOrderTraversal(treenode):
if not treenode:
return
postOrderTraversal(treenode.left_node)
postOrderTraversal(treenode.right_node)
print(treenode.data)
postOrderTraversal(binaryTree)