public class TreeNode {
public int val;
public TreeNode left;
public TreeNode right;
public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
this.val = val;
this.left = left;
this.right = right;
}
上面是一个节点类
下面是运用地柜去遍历每一个节点的值
//前序遍历
public void PreOrder(TreeNode node)
{
if (node != null)
{
print("输出该节点的值" + node.val)
PreOrder(node.left);
PreOrder(node.right);
}
}
//中序遍历
public void PreOrder(TreeNode node)
{
if (node != null)
{
PreOrder(node.left);
print("输出该节点的值" + node.val)
PreOrder(node.right);
}
}
//后序遍历
public void PreOrder(TreeNode node)
{
if (node != null)
{
PreOrder(node.left);
PreOrder(node.right);
print("输出该节点的值" + node.val)
}
}