python/tree.py at main · Shirisha-g08/python · GitHub

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
class node:
    def __init__(self,data):
        self.data=data
        self.right=None
        self.left=None
def dfs_inorder(root):
    if root==None:
        return
    dfs_inorder(root.left)
    print(root.data)
    dfs_inorder(root.right)
def dfs_preorder(root):
    if root==None:
        return
    print(root.data)
    dfs_preorder(root.left)
    dfs_preorder(root.right)
def dfs_postorder(root):
    if root==None:
        return
    dfs_postorder(root.left)
    dfs_postorder(root.right)
    print(root.data)

root=node(1)
root.right=node(3)
root.left=node(2)
root.left.left=node(4)
root.left.right=node(5)
print(root.data)
print(root.left.data)
print(dfs_inorder(root.data))
print(dfs_preorder(root.data))
print(dfs_postorder(root.data))