Leetcode 112: Path Sum
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.
[Read More]
-
-
Leetcode 111: Minimum Depth of Binary Tree
Question Given a binary tree, find its minimum depth. [Read More] -
Leetcode 110: Balanced Binary Tree
Question Given a binary tree, determine if it is height-balanced. [Read More] -
Leetcode 109: Convert Sorted List to Binary Search Tree
Question Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. [Read More] -
Leetcode 108: Convert Sorted Array to Binary Search Tree
Question Given an array where elements are sorted in ascending order, convert it to a height balanced BST. [Read More] -
Leetcode 106: Construct Binary Tree from Inorder and Postorder Traversal
Question Given inorder and postorder traversal of a tree, construct the binary tree. [Read More] -
Leetcode 105: Construct Binary Tree from Preorder and Inorder Traversal
Question Given preorder and inorder traversal of a tree, construct the binary tree. [Read More] -
Leetcode 107: Binary Tree Level Order Traversal II
Question Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root). [Read More] -
Leetcode 103: Binary Tree Zigzag Level Order Traversal
Question Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between). [Read More] -
Leetcode 102: Binary Tree Level Order Traversal
Question Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). [Read More] -
Leetcode 101: Symmetric Tree
Question Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). [Read More] -
Leetcode 98: Validate Binary Search Tree
Question Given a binary tree, determine if it is a valid binary search tree (BST). [Read More] -
Leetcode 95: Unique Binary Search Trees II
Question Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n. [Read More] -
Leetcode 96: Unique Binary Search Trees
Question Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n? [Read More] -
Leetcode 94: Binary Tree Inorder Traversal
Question Given a binary tree, return the inorder traversal of its nodes’ values. [Read More]