algorithm/

Details

回溯算法和 DFS 算法非常类似，本质上都是一种暴力穷举算法。回溯算法和 DFS 算法的细微差别是：回溯算法是在遍历树枝，DFS 算法是在遍历节点。

Path	Synopsis
leetcode
back-tracing/216-combination-sum-iii command
back-tracing/39-combination-sum command
back-tracing/40-combination-sum-ii command
back-tracing/46-permutations command
back-tracing/47-permutations-ii command
back-tracing/51-n-queens command
back-tracing/698-partition-to-k-equal-sum-subsets command
back-tracing/77-combinations command
back-tracing/78-subsets command
back-tracing/90-subsets-ii command
linked-list/21-merge-two-sorted-lists command
linked-list/23-merge-k-sorted-lists command
linked-list/86-partition-list command
tree/102-binary-tree-level-order-traversal command
tree/104-maximum-depth-of-binary-tree command
tree/116-populating-next-right-pointers-in-each-node command
tree/144-binary-tree-preorder-traversal command
tree/145-binary-tree-postorder-traversal command
tree/226-invert-binary-tree command
tree/543-diameter-of-binary-tree command
tree/94-binary-tree-inorder-traversal command
tree/987-vertical-order-traversal-of-a-binary-tree command