本文共 442 字,大约阅读时间需要 1 分钟。
代码所示为下图二叉树
中序遍历:CBDAEF
C,D,F有两个空指针域,E有一个
步骤如下:
1.创建二叉树
2.创建头结点
3.中序遍历线索化
4.中序遍历此线索二叉树(非递归方式)
public class ThreadedBinaryTree { private static String [] array = {"A","B","C","","","D","","","E","","F","",""}; private static int arrayIndex = 0; /** * 全局node,始终指向刚刚访问过的结点 */ private static ThreadedBinaryNode preNode; /** * 1.参考创建二叉树,前序遍历输入 */ public static ThreadedBinaryNode createThreadedBinaryTree(){ String data = ""; if(arrayIndex