public ListinorderTraversal(TreeNode root) { System.out.println("中序遍历"); List list = new ArrayList (); if(root!=null){ Stack stack = new Stack (); while(!stack.isEmpty() || root!=null){ if(root!=null){ stack.push(root); root = root.left; } else{ root = stack.pop(); list.add(root.val); root = root.right; } } } return list; }
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)