LeetCode 1302. Deepest Leaves Sum
Description https://leetcode.com/problems/deepest-leaves-sum/ Given a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root =…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/deepest-leaves-sum/ Given a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root =…
Description https://leetcode.com/problems/range-sum-of-bst/solution/ Given the root node of a binary search tree, return the sum of values of all nodes with a value in…
Description https://leetcode.com/problems/swap-nodes-in-pairs/ You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST…
Description https://leetcode.com/problems/flip-equivalent-binary-trees/ For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and…
Description https://leetcode.com/problems/count-complete-tree-nodes/ Given the root of a complete binary tree, return the number of the nodes in the tree. According to Wikipedia, every level, except…
Description https://leetcode.com/problems/word-ladder/ Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such…
Description https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ Serialization is the process of converting a data structure or object into a sequence of bits so that…
Description https://leetcode.com/problems/search-a-2d-matrix-ii/ You are given a perfect binary tree where all leaves are on the same level, and every parent has two children.…
Description https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ Given the root of a binary tree, return the zigzag level order traversal of its nodes’ values. (i.e., from left to…
Description https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do…