-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.py
36 lines (34 loc) · 798 Bytes
/
main.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
# import self as self
#
#
# class TreeNode:
# node_id: int
# node_parent: "TreeNode"
# node_children: ["TreeNode"]
#
# def __init__(self, node_id: int, parent: "TreeNode" = None):
# self.node_id = node_id
# self.parent = parent
# self.children = []
#
#
# class BinaryTree:
#
# __root: TreeNode
# __node_count: int
#
# def __init__(self):
# self.__root = TreeNode(-1)
# self.__node_count = 1
#
# def add_node_by_list_at_node(self, input_list: [int], node: TreeNode):
# if len(input_list) > 0:
# for child in node.children:
# if child.node_id == node.node_id:
#
# self.add_node_by_list_at_node(input_list[1:], node)
#
#
# newTree = BinaryTree()
# pass
print("hello python")