wwHRestarting的博客

非递归深度优先遍历需要用到的辅助数据结构为：栈（stack）public void depthOrderTraversalNoRecursive() { if (root==null) { System.out.println("根节点为空"); } else{ ArrayDeque stack = new ArrayDeque(); stack.push

public void depthOrderTraversalWithRecursive() { depthTraversal(root); } private void depthTraversal(TreeNode tn) { if (tn!=null&&!tn.equals(null)) { System.out.print(tn.value+" ");

广度优先遍历需要用的辅助数据结构为：队列private void levelOrderTraversalNoRecursive() { if (root==null) { System.out.println("empty tree"); } ArrayDeque queue = new ArrayDeque(); queue.add(root); w

二叉树ADT(abstract data type)：二叉树节点类：class TreeNode{ int value; TreeNode left; TreeNode right; public TreeNode(int paraValue) { this.value = paraValue; } }二叉树类：public cl