Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/kth-smallest-element-in-a-bst/ Given the root of a binary search tree, and an integer k, return the kth (1-indexed) smallest element in the tree. Example 1: Input: root…
Description https://leetcode.com/problems/binary-tree-inorder-traversal/ Given a binary tree, return the inorder traversal of its nodes’ values. Example: Input: [1,null,2,3] 1 \ 2 / 3…
Description https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/ Return the root node of a binary search tree that matches the given preorder traversal. (Recall that a binary search tree is a…
Description https://leetcode.com/problems/diameter-of-binary-tree/ Given a binary tree, you need to compute the length of the diameter of the tree. The diameter…
Description https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For…
Description https://leetcode.com/problems/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…
Description https://leetcode.com/problems/binary-tree-level-order-traversal/ Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by…
Description https://leetcode.com/problems/minimum-depth-of-binary-tree/ Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the…
Description https://leetcode.com/problems/balanced-binary-tree/ Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined…
Description Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest…