【代码示例】

package com.wcs.java;
import java.util.ArrayList;
import java.util.List;

public class BinaryTree { 
    
    
    class TreeNode {
        
        public String data; //数据
        
        public TreeNode leftNode; //左子树
        
        public TreeNode rightNode; //右子树
        
        public TreeNode(String data, TreeNode leftNode, TreeNode rightNode) {
            this.data = http://www.mamicode.com/data;>

【二叉树】

【运行结果】

先序遍历: A-C-D-B-E-F-G-I-J-H
中序遍历: D-B-C-A-F-J-I-G-E-H
后序遍历: B-D-C-J-I-G-F-H-E-A