본문 바로가기

binary tree17

[Leetcode 212] - Word Search II w/ Python Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word. 각 칸마다 글자가 들어있는 m x n 크기의 보드가 주어진다. 단어가 들어있는 words 배열 또한 주어진다 보드에 단어가 들어있으면 배열에 단어를 포함 시켜 리턴하는 문제 보드에.. 2024. 4. 11.
[Leetcode 211] - Design Add and Search Words Data Structure w/ Python Design a data structure that supports adding new words and finding if a string matches any previously added string. Implement the WordDictionary class: ● WordDictionary() Initializes the object. ● void addWord(word) Adds word to the data structure, it can be matched later. ● bool search(word) Returns true if there is any string in the data structure that matches word or false otherwise. word may.. 2024. 4. 11.
[Leetcode 208] - Implement Trie (Prefix Tree) w/ Python A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker. Implement the Trie class: ● Trie() Initializes the trie object. ● void insert(String word) Inserts the string word into the trie. ● boolean search(String word) True i.. 2024. 4. 11.
[Leetcode 297] - Serialize and Deserialize Binary Tree w/ Python Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment. Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization al.. 2024. 4. 11.
[Leetcode 124] - Binary Tree Maximum Path Sum w/ Python A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root. The path sum of a path is the sum of the node's values in the path. Given the root of a binary tree, return the maximum path sum of any non-empty path. 이진 트리가 주.. 2024. 4. 11.
[Leetcode 105] - Construct Binary Tree from Preorder and Inorder Traversal w/ Python Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree. 전위 순회와 중위 순회가 주어진다면, 이를 통해 이진 트리를 만드는 문제 https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/ Example 1: Input: preorder = [3,9,20,15,7], inorder = [9,3,.. 2024. 4. 11.
[Leetcode 230] - Kth Smallest Element in a BST w/ Python Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree. 이진 탐색 트리가 주어졌을때 트리에서 k 번째 작은 숫자를 리턴하는 문제 https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/ Example 1: Input: root = [3,1,4,null,2], k = 1 Output: 1 Example 2: Input: root = [5,3,6,2,4,null,null,1], k = 3 Output: 3 이진 탐색 트리인 만큼 중위 순.. 2024. 4. 10.
[Leetcode 98] - Validate Binary Search w/ Python 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 search trees. 이진 트리가 주어졌을때 이진 탐색 트리인지 확인하는 문제 각 .. 2024. 4. 10.
[Leetcode 1448] - Count Good Nodes in Binary Tree w/ Python Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. Return the number of good nodes in the binary tree. 이진 트리가 주어졌을때 다음으로 탐색할 노드의 값이 현재 위치한 노드의 값보다 큰 숫자를 파악해서 리턴 ※ Root 노드는 언제나 포함된다 https://leetcode.com/problems/count-good-nodes-in-binary-tree/description/ Example 1: Input: root = [3,1,4,3,null,1,5] Output: 4 .. 2024. 4. 10.
반응형

티스토리툴바