文档介绍：二叉树遍历(递归)[java]代码:.wzs;//测试二叉树遍历,lassTestBinaryTree{publicstaticvoidmain(String[]args){Node<String>g=newNode<String>("G",null,null);Node<String>e=newNode<String>("E",null,null);Node<String>f=newNode<String>("F",null,null);Node<String>d=newNode<String>("D",null,g);Node<String>b=newNode<String>("B",d,e);Node<String>c=newNode<String>("C",null,f);Node<String>a=newNode<String>("A",b,c);("生成的二叉树:");("A");("|");("|---------|");("BC");("||");("|---------|-----|");("DEF");("|");("----|");("G");("二叉树深度:"+(a));("前序遍历:");(a);();("中序遍历:");(a);();("后序遍历:");(a);();}}//二叉树classBinaryTree{//前序遍历static<T>voidpriorderTraversal(Node<T>node){if(node!=null){visitNode(node);priorderTraversal(());priorderTraversal(());}}//中序遍历static<T>voidinorderTraversal(Node<T>node){if(node!=null){inorderTraversal(());visitNode(node);inorderTraversal(());}}//后序遍历static<T>voidpostorderTraversal(Node<T>node){if(node!=null){postorderTrav