IfUwanna IT

💻 Jihun's Ifuwanna IT :: Tech Blog 😃

binary tree 검색 결과

해당 글 7건

[LeetCode] 669. Trim a Binary Search Tree - 문제풀이

Description 이진검색트리의 root와 트리안의 최대값, 최소값이 주어졌을때 주어진 최대, 최소값을 Trim한뒤 반환해주는 문제입니다. Given the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies in [low, high]. Trimming the tree should not change the relative structure of the elements that will remain in the tree (i.e., any node's descendant should remain a descendant). It..

알고리즘/LeetCode 2022. 4. 26. 10:03

[LeetCode] 235. Lowest Common Ancestor of a Binary Search Tree - 문제풀이

Description 이진검색트리에서 주어진 두 노드의 가장 최하위 공통 조상 LCA를 찾아 반환하는 문제입니다. Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).” E..

알고리즘/LeetCode 2022. 2. 14. 17:47

[Leetcode] 98. Validate Binary Search Tree - 문제풀이

Description 주어진 이진트리가 유효한 이진탐색트리인지 여부를 반환하는 문제입니다. Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary sea..

알고리즘/LeetCode 2022. 2. 14. 13:45

[LeetCode] 701. Insert into a Binary Search Tree - 문제풀이

Description 주어진 이진 검색 트리에서 특정 값을 올바른 노드에 삽입 후 root를 반환하는 문제입니다. You are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST. Notice that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after inserti..

알고리즘/LeetCode 2022. 2. 14. 13:12

[LeetCode] 144. Binary Tree Preorder Traversal - 문제풀이

Description 전위 순회(preorder-traversal)하며 값을 읽어 List에 순서대로 넣어 반환하는 문제입니다. Given the root of a binary tree, return the preorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,2,3] Example 2: Input: root = [] Output: [] Example 3: Input: root = [1] Output: [1] Constraints: The number of nodes in the tree is in the range [0, 100]. -100 right 순으로 전위 순회(preorder-traver..

알고리즘/LeetCode 2022. 1. 27. 16:32

[LeetCode] 1305. All Elements in Two Binary Search Trees - 문제 풀이

Description Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order. Example 1: Input: root1 = [2,1,4], root2 = [1,0,3] Output: [0,1,1,2,3,4] Example 2: Input: root1 = [1,null,8], root2 = [8,1] Output: [1,1,8,8] Constraints: The number of nodes in each tree is in the range [0, 5000]. -10^5

알고리즘/LeetCode 2022. 1. 26. 15:30

[LeetCode] 116. Populating Next Right Pointers in Each Node - 문제풀이

Description 완전이진트리에서 같은 깊이의 오른쪽에 있는 노드를 연결해나가는 문제입니다. You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition: struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to..

알고리즘/LeetCode 2022. 1. 13. 03:43