1. ArrayNodes = [-1,-1,-1] * 2
2. RootPointer = -1
3. FreeNode = 0
4. def AddNode(ArrayNodes, RootPointer, FreeNode):
5.     NodeData = int(input("Enter the data"))
6.     if FreeNode <= 19:
7.         ArrayNodes[FreeNode][0] = -1
8.         ArrayNodes[FreeNode][1] = NodeData
9.         ArrayNodes[FreeNode][2] = -1
10.         if RootPointer == -1:
11.             RootPointer = 0
12.         else:
13.             Placed = False
14.             CurrentNode = RootPointer
15.             while Placed == False:
16.                 if NodeData < ArrayNodes[CurrentNode][1]:
17.                     if ArrayNodes[CurrentNode][0] == -1:
18.                         ArrayNodes[CurrentNode][0] = FreeNode
19.                         Placed = True
20.                     else:
21.                         CurrentNode = ArrayNodes[CurrentNode][0]
22.                 elif ArrayNodes[CurrentNode][2] == -1:
23.                     ArrayNodes[CurrentNode][2] = FreeNode
24.                     Placed = True
25.                 else:
26.                     CurrentNode = ArrayNodes[CurrentNode][2]
27.             FreeNode = FreeNode + 1
28.         print("Tree is full")
29.  
30. def PrintAll(ArrayNodes):
31.     for i in range(20):
32.         print(ArrayNodes[i][0], ArrayNodes[i][1], ArrayNodes[i][2])
33.  
34. for i in range(10):
35.     AddNode(ArrayNodes, RootPointer, FreeNode)
36. PrintAll(ArrayNodes)
37.