Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes
#面试刷题
该标签下的全部文章。
Neighbor Node
Find the immediate right neighbor of the given node, with parent links given, but without root node.
Next Node without Parent
In-order traverse a binary search tree without parent links, find the next node to visit given a specific node
Paths with Sum II
You are given a binary tree in which each node contains an integer value (which might be positive or negative)
Node Path Sum
Get all the paths (from any node to any other node with deeper level) in a binary tree, whose sum would be equ
Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes' values.