后序遍历结果：DEBFCA

算法4(Java语言)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

publicclassTreeNode{      intval;      TreeNodeleft;      TreeNoderight;      TreeNode(intx){          val = x;      } } public  void  postOrder(TreeNodebiTree){      TreeNodeleftTree = biTree.left;      if  (leftTree !=  null ) {          postOrder(leftTree);      }      TreeNoderightTree=biTree.right;      if (rightTree !=  null ){          postOrder(rightTree);      }      System.out.printf(biTree.val+ "" ); }