Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
[Read More]
124. Binary Tree Maximum Path Sum
Hard
Given a non-empty binary tree, find the maximum path sum.
[Read More]
117. Populating Next Right Pointers in Each Node II
Medium
Given a binary tree
struct Node {
int val;
Node *left;
Node *right;
Node *next;
}
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
[Read More]
116. Populating Next Right Pointers in Each Node
Medium
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:
[Read More]
114. Flatten Binary Tree to Linked List
Medium
Given a binary tree, flatten it to a linked list in-place.
[Read More]
106. Construct Binary Tree from Inorder and Postorder Traversal
Medium
Description
[Read More]