图解二叉树的三种遍历方式及java实现代码

  // 定义节点类：  private static class BinNode {    private Object element;    private BinNode lChild;// 定义指向左子树的指针    private BinNode rChild;// 定义指向右子树的指针    public BinNode(Object element, BinNode lChild, BinNode rChild) {      this.element = element;      this.lChild = lChild;      this.rChild = rChild;    }  }