[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/ Construct Binary Tree from Preorder and Inorder Traversal - LeetCode Can you solve this real interview question? Construct Binary Tree from Preorder and Inorder Traversal - Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the i..
[LeetCode] 230. Kth Smallest Element in a BST - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/ Kth Smallest Element in a BST - LeetCode Kth Smallest Element in a BST - 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. Example 1: [https://assets.leetcode.com/uploads/2021/01/28/kthtree1.jpg] Inpu leetcode.com 문제 Given the root..
HYOJUN
'중위순회' 태그의 글 목록