08 2020 档案
二叉树的非递归遍历和层次遍历,利用栈和队列来实现
摘要:public static void inOrder2(Node node) { Stack<Node> stack = new Stack<>(); Node p = node; while (p != null || !stack.isEmpty()) { if (p != null) { st 阅读全文
posted @ 2020-08-26 22:35 lkjhgfdsa123 阅读(494) 评论(0) 推荐(0)