/**
*@Title: PostOrder.java
*@Package binarytree
*@Description: TODO
*@author peidong
*@date 2017-4-28 上午9:30:32
*@version V1.0
*/
packagebinarytree;
importjava.util.Stack;
importbinarytree.InOrder.TreeNode;
/**
* @ClassName: PostOrder
* @Description: 后序遍历二叉树
* @date 2017-4-28 上午9:30:32
*
*/
publicclass PostOrder {
/**
*
* @ClassName: TreeNode
* @Description: 构建树结点
* @date 2017-4-28 上午9:31:07
*
*/
public static class TreeNode{
public int data;
public TreeNode left;
public TreeNode right;
public TreeNode(int data){
this.data = data;
left = null;
right = null;
}
}
/**
*
* @Title: PostOrderRec
* @Description: 递归后序遍历二叉树
* @param @param root
* @return void
* @throws
*/
public void postOrderRec(TreeNode root){
//边界条件
if(root ==null){
return;
}else{
postOrderRec(root.left);
postOrderRec(root.right);
System.out.println(root.data);
}
}
/**
*
* @Title: PostOrder
* @Description: 非递归的方式后序遍历二叉树
* @param @param root
* @return void
* @throws
*/
public void postOrder(TreeNode root) {
// 边界条件
if (root == null) {
return;
}
Stack<TreeNode> tnSatck =new Stack<TreeNode>();
while (root != null ||tnSatck.empty() == false) {
while (root != null) {
tnSatck.push(root); //左子树入栈
root = root.left;
}
if (tnSatck.empty() ==false) {
if(root.right ==null||root == null){
tnSatck.pop();
System.out.println(root.data);
}else{
root =root.right;
}
}
}
}
/**
*@Title: main
*@Description: TODO
*@param @param args
*@return void
*@throws
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
PostOrder tree = new PostOrder();
TreeNode root = new TreeNode(10);
root.left = new TreeNode(8);
root.right = new TreeNode(2);
root.left.left = new TreeNode(3);
root.left.right = new TreeNode(5);
root.right.left = new TreeNode(2);
tree.postOrder(root); //
}
}
扫一扫
673
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
