二叉树的前序遍历主要规则是:
1. 先访问父节点,左子节点次之,又子节点再次之;
2. 如果子节点包含子节点,对子节点进行前序遍历
代码实现如下:
public class TreeNode{
//左子节点
private TreeNode left = null;
//又子节点
private TreeNode right = null;
//数据
private int data = 0;
//前序遍历访问
private static String headFirstVisit(TreeNode root){
if(root == null){
return "";
}
if(root.left == null && root.right == null){
return root.data + ",";
}
StringBuilder path = new StringBuilder(root.data + ",");
if(root.left != null){
path.append(headFirstVisit(root.left));
}
if(root.right != null){
path.append(headFirstVisit(root.right));
}
return path;
}
}