## Path Sum II

QUESTION Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. This question is provided by LeetCode.

QUESTION Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. This question is provided by LeetCode.

QUESTION Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. This question is provided by LeetCode.

QUESTION Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. This question is provided by LeetCode.

QUESTION Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. This question is provided by LeetCode.

QUESTION Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). This question is provided by LeetCode.

QUESTION Given a binary tree, return the inorder traversal of its nodes’ values, without using recursion. This question is provided by LeetCode.

QUESTION Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1. This question is provided by LeetCode.