newbie

## [leetcode] 108. Convert Sorted Array to Binary Search Tree

Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.A height-balanced bin

2021년 11월 29일
·
0개의 댓글

## [leetcode] 104. Maximum Depth of Binary Tree

Given the root of a binary tree, return its maximum depth.A binary tree's maximum depth is the number of nodes along the longest path from the root no

2021년 11월 29일
·
0개의 댓글

## [leetcode] 101. Symmetric Tree

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).root 노드를 기준으로 한칸씩 아래로 내려갈 때 마다 left, right

2021년 11월 27일
·
1개의 댓글

## [leetcode] 100. Same Tree

Given the roots of two binary trees p and q, write a function to check if they are the same or not.Two binary trees are considered the same if they ar

2021년 11월 26일
·
0개의 댓글

## [leetcode] 95. Unique Binary Search Trees II

Given an integer n, return all the structurally unique BST's (binary search trees), which has exactly n nodes of unique values from 1 to n. Return the

2021년 11월 25일
·
0개의 댓글

## [leetcode] 94. Binary Tree Inorder Traversal

Given the root of a binary tree, return the inorder traversal of its nodes' values.Example 1:Input: root = 1,null,2,3Output: 1,3,2

2021년 11월 25일
·
0개의 댓글

## [leetcode] 88. Merge Sorted Array

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in num

2021년 11월 24일
·
0개의 댓글

## [leetcode] 35. Search Insert Position

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if i

2021년 10월 18일
·
0개의 댓글

## [leetcode] 278. First Bad Version

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c

2021년 10월 18일
·
0개의 댓글

## [leetcode] 704. Binary Search

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists

2021년 10월 18일
·
0개의 댓글

## [leetcode] 10. Regular Expression Matching

10. Regular Expression Matching

2021년 10월 14일
·
14개의 댓글

## [leetcode] Symmetric Tree .101

Given the roots of two binary trees p and q, write a function to check if they are the same or not.Two binary trees are considered the same if they ar

2021년 10월 13일
·
0개의 댓글

## [leetcode] 100.Same Tree

leetcode 100. same tree

2021년 10월 13일
·
0개의 댓글