# LeetCode 1161. Maximum Level Sum of a Binary Tree

Description https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/ Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and…

Be a Good Techer and Tech for Good. www.goodtecher.com

Description https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/ Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and…

Description https://leetcode.com/problems/all-possible-full-binary-trees/ Given an integer n, return a list of all possible full binary trees with n nodes. Each node of each tree in the answer…

Description https://leetcode.com/problems/binary-tree-maximum-path-sum/ A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence…

Description https://leetcode.com/problems/binary-search-tree-iterator/ Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST): BSTIterator(TreeNode root) Initializes an object…

Description https://leetcode.com/problems/binary-tree-vertical-order-traversal/ Given the root of a binary tree, return the vertical order traversal of its nodes’ values. (i.e., from top to bottom, column…

Description https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/ Given the root of a binary tree, return the lowest common ancestor of its deepest leaves. Recall that: The node of a…

Description https://leetcode.com/problems/binary-tree-right-side-view/ Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you…

Description https://leetcode.com/problems/matrix-block-sum/ Given the root of a binary tree, return the same tree where every subtree (of the given tree) not containing a 1 has…

Description https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/ Given two nodes of a binary tree p and q, return their lowest common ancestor (LCA). Each node will have a reference to its…

Description https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/ Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each…