Algorithm/자료구조 (126) 썸네일형 리스트형 (C++) - LeetCode (easy) 572. Subtree of Another Tree https://leetcode.com/problems/subtree-of-another-tree/description/ Subtree of Another Tree - LeetCode Can you solve this real interview question? Subtree of Another Tree - Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise. A subtree of a bin leetcode.com tree 순회 문제였습니다. 📕 풀이방법 📔 풀.. (C++) - LeetCode (easy) 563. Binary Tree Tilt https://leetcode.com/problems/binary-tree-tilt/description/ Binary Tree Tilt - LeetCode Can you solve this real interview question? Binary Tree Tilt - Given the root of a binary tree, return the sum of every tree node's tilt. The tilt of a tree node is the absolute difference between the sum of all left subtree node values and all right subtr leetcode.com 자료구조 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 왼쪽과 오른쪽 s.. (C++) - LeetCode (easy) 557. Reverse Words in a String III https://leetcode.com/problems/maximum-depth-of-n-ary-tree/description/ Maximum Depth of N-ary Tree - LeetCode Can you solve this real interview question? Maximum Depth of N-ary Tree - Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Nary-Tree input seriali leetcode.com 재귀적인 tree 순회로 해결한 .. (C++) - LeetCode (easy) 543. Diameter of Binary Tree https://leetcode.com/problems/diameter-of-binary-tree/description/ Diameter of Binary Tree - LeetCode Can you solve this real interview question? Diameter of Binary Tree - Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path leetcode.com 재귀함수를 이용해 답을 구하는 문제였습니다. 📕.. (C++) - LeetCode (easy) 530. Minimum Absolute Difference in BST https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/ Minimum Absolute Difference in BST - LeetCode Can you solve this real interview question? Minimum Absolute Difference in BST - Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree. Example 1: [https://assets.l leetcode.com tree 순회.. (C++) - LeetCode (easy) 506. Relative Ranks https://leetcode.com/problems/relative-ranks/description/ Relative Ranks - LeetCode Can you solve this real interview question? Relative Ranks - You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be unique. The athletes are placed based on their leetcode.com 자료구조 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 정답 vector .. (C++) - LeetCode (easy) 500. Keyboard Row https://leetcode.com/problems/find-mode-in-binary-search-tree/description/ Find Mode in Binary Search Tree - LeetCode Can you solve this real interview question? Find Mode in Binary Search Tree - Given the root of a binary search tree (BST) with duplicates, return all the mode(s) [https://en.wikipedia.org/wiki/Mode_(statistics)] (i.e., the most frequently occurred element leetcode.com tree 순회 문제.. (C++) - LeetCode (easy) 476. Number Complement https://leetcode.com/problems/number-complement/description/ Number Complement - LeetCode Can you solve this real interview question? Number Complement - The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation. * For example, The integer 5 is "101" in binary and it leetcode.com bitmasking을 사용해보는 문제였습니다. 📕 풀이방법 📔 입력 .. 이전 1 ··· 4 5 6 7 8 9 10 ··· 16 다음