//深度优先遍历的递归写法 function DFTraversal(node) { var nodes = []; if (node != null) { nodes.push(node); var children = node.children; for (var i = 0; i < children.length; i++){ deepTraversal(children[i]); } } return nodes; } //深度优先遍历的非递归写法 function DFT(node
节点数据结构 class TreeNode { TreeNode left = null; TreeNode right = null; } 最大深度,基本思路是:使用递归,分别求出左子树的深度.右子树的深度,两个深度的较大值+1就是最大深度. // 获取最大深度 public static int getMaxDepth(TreeNode treeNode) { if (treeNode == null) return 0; else { int left = getMaxDepth(tree
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7 return its
1.二叉树的建立 首先,定义数组存储树的data,然后使用list集合将所有的二叉树结点都包含进去,最后给每个父亲结点赋予左右孩子. 需要注意的是:最后一个父亲结点需要单独处理 public static TreeNode root; //建立二叉树内部类 class TreeNode{ public Object data; //携带变量 public TreeNode lchild,rchild; //左右孩子 public TreeNode() { data = null; lchild
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example:Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 retur