hyunkookim 님의 블로그

98. Validate Binary Search Tree 처음 내 코드 # Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution: def isValidBST(self, root: Optional[TreeNode]) -> bool: # bfs 로 내려가면서 좌우 비교하면 될듯 # bfs 는 큐로 que = deque([root]) while que: ..

230. Kth Smallest Element in a BST # Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution: def kthSmallest(self, root: Optional[TreeNode], k: int) -> int: # 왼->현->오른쪽..으로 리스트업하면. 즉 inorder 순회 전체 나오고 거기에서.. k번째 찾으면 됨 res = [] def..

530. Minimum Absolute Difference in BST # Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution: def getMinimumDifference(self, root: Optional[TreeNode]) -> int: # BST 이므로, inorder (좌, 현재, 우) 로 출력하면, 작->큰, 오름차순으로 값이 나옴 arr = [] d..

103. Binary Tree Zigzag Level Order Traversal # Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution: def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]: # bfs => 큐로 if not root: return [] res = [..

102. Binary Tree Level Order Traversal # Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution: def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]: # bfs -> 큐로 if not root: return [] res = [] que ..