Hackerrank_Practice/CheckBinaryTree.py at master · ZihaoZhou/Hackerrank_Practice · 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
""" Node is defined as
class node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None
"""

# Do an inorder traversal to see if the data is in ascent order

def checkBST(root):
    global data_list
    data_list = []
    if(root != None):
        inorder_traversal(root)

    if(len(data_list) != 0):
        previous = data_list[0]
        for i in range(1, len(data_list)):
            if previous >= data_list[i]:
                return False;
            previous = data_list[i];
    return True

def inorder_traversal(root):
    if(root.left != None):
        inorder_traversal(root.left)
    data_list.append(root.data)
    if(root.right != None):
        inorder_traversal(root.right)