摘要:
遍历二叉树的三种方法:前序:根节点->左子树->右子树中序:左子树->根节点->右子树后序:左子树->右子树->根节点前序遍历的递归算法:public void preOrderRecursion(BinaryTreeNode root,List list){if(root==null) return ;list.insertLast(root);preOrderRecursion(root.getLChild(),list);preOrderRecursion(root.getRChild(),list);}中序遍历的递归算法:public void in
阅读全文
posted @ 2014-03-11 11:07
hadoop-yang
阅读(165)
推荐(0)
编辑