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.
Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.
Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can
Root Path Sum
Get all the paths (always starts from the root) in a binary tree, whose sum would be equal to given value.
Route Between Nodes
Given a directed graph, design an algorithm to find out whether there is a route between two nodes
Scramble String
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursi