MCPcopy Create free account
hub / github.com/algorithm004-01/algorithm004-01 / dfs_helper

Method dfs_helper

Week 03/id_306/LevelOrder.java:65–77  ·  view source on GitHub ↗

递归遍历左右分支树，但是需要传当前深度（层），这样出栈时就可以确定自己的层并保存正确 @param node @param level @param levels

(TreeNode node,int level,List<List<Integer>> levels)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

levelOrder_dfsMethod · 0.95

Calls 3

sizeMethod · 0.65
getMethod · 0.65
addMethod · 0.45

Tested by

no test coverage detected