Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/all-elements-in-two-binary-search-trees/ You are given an integer array nums with no duplicates. A maximum binary tree can be built recursively from nums using the following algorithm:…
Description https://leetcode.com/problems/all-elements-in-two-binary-search-trees/ Given two binary search trees root1 and root2. Return a list containing all the integers from both trees sorted in ascending order. Example 1: Input: root1 =…
Description https://leetcode.com/problems/leaf-similar-trees/ Consider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf…
Description https://leetcode.com/problems/minimum-distance-between-bst-nodes/ Given the root of a Binary Search Tree (BST), return the minimum difference between the values of any two different nodes…
Description https://leetcode.com/problems/sum-of-left-leaves/ Given the root of a binary tree, return the sum of all left leaves. Example 1: Input: root = [3,9,20,null,null,15,7]…
Description https://leetcode.com/problems/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…
Description https://leetcode.com/problems/path-crossing/ Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children. Example 1:…
Description https://leetcode.com/problems/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…
Description https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/ Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this…
Description https://leetcode.com/problems/construct-string-from-binary-tree/ You need to construct a string consists of parenthesis and integers from a binary tree with the preorder…