Menu



Manage

Cord > Study_Algorithm 전체 다운로드
Study_Algorithm > 12/week12_02_chap08_03.py Lines 33 | 807 바이트
다운로드

                        # week12_02_chap08_03.py
class TreeNode:
    def __init__(self):
        self.left = None
        self.data = None
        self.right = None


root = None
nameAry = ['블랙핑크', '레드벨벳', '마마무', '에이핑크',  '걸스데이', '트와이스' ]

node = TreeNode()
node.data = nameAry[0]
root = node

for name in nameAry[1:]:
    node = TreeNode()
    node.data = name

    current = root
    while True:
        if name < current.data:
            if current.left is None:
                current.left = node
                break
            current = current.left
        else :
            if current.right is None:
                current.right = node
                break
            current = current.right

print("이진 탐색 트리 구성 완료!")