부부의 코딩 성장 일기

1. 문제 링크 https://leetcode.com/problems/validate-binary-search-tree/ Validate Binary Search Tree - LeetCode Can you solve this real interview question? Validate Binary Search Tree - 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 le leetcode.com 2. 문제 설명 주어진 tree가 이진..

1. 문제 링크 Binary Tree Postorder Traversal - LeetCode Binary Tree Postorder Traversal - LeetCodeCan you solve this real interview question? Binary Tree Postorder Traversal - Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: [https://assets.leetcode.com/uploads/2020/08/28/pre1.jpg] Input: root = [1,nuleetcode.com2. 문제 설명 트리 순회 위키피디아 트리 순회 - 위키백과, 우리 모두..