/**
* @Description
* @Author lvxincun
* @Date 2020-08-05 19:32
*/
public class TreeNode1 {
private String data;
private TreeNode1 left;
private TreeNode1 right;
public TreeNode1() {
}
public TreeNode1(String data) {
this.data = data;
left = right = null;
}
public String getData() {
return data;
}
public void setData(String data) {
this.data = data;
}
public TreeNode1 getLeft() {
return left;
}
public void setLeft(TreeNode1 left) {
this.left = left;
}
public TreeNode1 getRight() {
return right;
}
public void setRight(TreeNode1 right) {
this.right = right;
}
/**
* 先根遍历
*
* @param treeNode
*/
public void preOrder(TreeNode1 treeNode) {
if (treeNode != null) {
System.out.print(treeNode.getData() + "-");
preOrder(treeNode.left);
preOrder(treeNode.right);
}
}
/**
* 中根遍历
*
* @param treeNode
*/
public void midOrder(TreeNode1 treeNode) {
if (treeNode != null) {
midOrder(treeNode.left);
System.out.print(treeNode.getData() + "-");
midOrder(treeNode.right);
}
}
/**
* 后根遍历
*
* @param treeNode
*/
public void postOrder(TreeNode1 treeNode) {
if (treeNode != null) {
postOrder(treeNode.left);
postOrder(treeNode.right);
System.out.print(treeNode.getData() + "-");
}
}
}
二叉树的三种遍历方式(JAVA版)
最新推荐文章于 2024-08-05 11:11:16 发布