FilesExpand file tree

main

/

binary_tree.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (43 loc) · 1.41 KB

main

/

binary_tree.py

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (43 loc) · 1.41 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

class Node:

def __init__(self, value = None):

self.value = value

self.root = None

self.left = None

self.right = None

def insertNodeAtLeft(self, node):

self.left = node

self.left.root = self.root

def insertNodeAtRight(self, node):

self.right = node

self.right.root = self.root

def printTree(self):

print(self.value)

node1 = self

node2 = self

while (node1.left is not None):

print(node1.left.value, end = " ")

if (node1.left.left is not None):

print(node1.left.left.value, end = " ")

if (node1.left.right is not None):

print(node1.left.right.value)

node1 = node1.left

while (node2.right is not None):

print(node2.right.value)

if (node2.right.left is not None):

print(node2.right.left.value, end = " ")

if (node2.right.right is not None):

print(node2.right.right.value)

node2 = node2.right

if __name__ == "__main__":

node1 = Node(1)

node1.insertNodeAtLeft(Node(2))

node1.insertNodeAtRight(Node(3))

#node1.printTree()

node2 = Node(23)

node2.insertNodeAtLeft(Node(42))

node2.insertNodeAtRight(node1)

#node2.printTree()

node3 = Node(69)

node3.insertNodeAtLeft(node1)

node3.insertNodeAtRight(node1)

node3.printTree()