qq_40403758的博客

leetcode二叉树的层序遍历相关例题 均采用深度优先搜索（dfs） 102. 二叉树的层序遍历 var levelOrder = function(root) { if(root === null){ return []; } return dfs(root); function dfs(root){ let ans = []; let nodeQueue = [root]; while(nodeQueue

Leetcode 103 二叉树的锯齿形层序遍历 function TreeNode(val) { this.val = val; this.left = this.right = null; }; var zigzagLevelOrder = function(root) { if (!root) { return []; } return dfs(root); function dfs(root){ const