二叉树的算法实现

1、二叉树算法实现二叉树的三种遍历：根据访问结点操作发生位置命名：NLR：前序遍历(PreorderTraversal亦称(先序遍历) 访问根结点的操作发生在遍历其左右子树之前。LNR：中序遍历(InorderTraversal) 访问根结点的操作发生在遍历其左右子树之中(间)。LRN：后序遍历(PostorderTraversal) 访问根结点的操作发生在遍历其左右子树之后。注意：由于被访问的结点必是某子树的根，所以N(Node)、L(Left subtree)和R(Right subtree)又可解释为根、根的左子树和根的右子树。NLR、LNR和LRN分别又称为先根遍历、 中根遍历和后根遍历。

2、二叉树 java 实现代码：package com.dgy.arithmetic;/binarytreesearch 二叉树查找public class BinaryTreeSearch /数据节点private int data_node ;/左子树private BinaryTreeSearch left;/右子树private BinaryTreeSearch right;/构造方法public BinaryTreeSearch( int data_node) this.data_node = data_node; this.left = null;this.right = null;/

3、先判断二叉树是否为空，为空则创建二叉树public static BinaryTreeSearch create_binarytree( int input) BinaryTreeSearch root = null;BinaryTreeSearch temp = null; for(int i=0;iinput. length;i+)if(root=null) /创建根结点root=temp= new BinaryTreeSearch(inputi);else/返回根结点temp = root;/添加节点while(temp. data_node !=inputi) if(inputi=te

4、mp. data_node ) if(temp.left!=null) temp = temp. left;elsetemp.left=new BinaryTreeSearch(inputi); elseif(temp.right!=null)temp = temp. right;elsetemp.right=new BinaryTreeSearch(inputi);return root;/前序遍历public static void preorder_traversal(BinaryTreeSearch binaryTreeSearch)if(binaryTreeSearch!= null

5、) System.out.print(binaryTreeSearch. data_node+ ); preorder_traversal (binaryTreeSearch. left); preorder_traversal (binaryTreeSearch. right);/后序遍历public static void postorder_traversal(BinaryTreeSearch binaryTreeSearch)if(binaryTreeSearch!= null) postorder_traversal (binaryTreeSearch. left); postord

6、er_traversal (binaryTreeSearch. right); System.out.print(binaryTreeSearch. data_node+ );/中序遍历public static void inorder_traversal(BinaryTreeSearch binaryTreeSearch)if(binaryTreeSearch!= null)inorder_traversal (binaryTreeSearch. left);System.out.print(binaryTreeSearch. data_node+ ); inorder_traversal

7、 (binaryTreeSearch. right);/层次遍历public static void levelorder_traversal()public static void main(String args) int input= 3,4,9,43,5,23,24,57;BinaryTreeSearch binaryTreeSearch = create_binarytree (input);System. out .println(前序遍历：)；preorder_traversal (binaryTreeSearch);System. out.println();System. out .println(中序遍历：)；postorder