Search - treebintree

Search - treebintree - List

[Mathimatics-Numerical algorithms] treebintree DL : 0: （1）输入字符序列，建立二叉链表。（2）中序遍历二叉树:递归算法。（3）中序遍历二叉树:非递归算法（最好也能实现先序，后序非递归算法）。（4）求二叉树的高度。（5）求二叉树的叶子个数。（6）建立中序线索二叉树，并实现中序遍历。（8）借助队列实现二叉树的层次遍历。（9）在主函数中设计一个简单的菜单，分别调试上述算法。
Date : 2008-10-13 Size : 68.73kb User : jack
[Mathimatics-Numerical algorithms] treebintree DL : 0: （1）输入字符序列，建立二叉链表。（2）中序遍历二叉树:递归算法。（3）中序遍历二叉树:非递归算法（最好也能实现先序，后序非递归算法）。（4）求二叉树的高度。（5）求二叉树的叶子个数。（6）建立中序线索二叉树，并实现中序遍历。（8）借助队列实现二叉树的层次遍历。（9）在主函数中设计一个简单的菜单，分别调试上述算法。 -(1) input sequence of characters, the establishment of binary list. (2) traversal of binary tree: recursive algorithm. (3) in order binary tree traversal: Non-recursive algorithm (the best can achieve the first order, after the sequence of non-recursive algorithm). (4) for tree height. (5) for the number of tree leaves. (6) in order to establish clues to binary tree and traversal implementation. (8) through the queue to achieve the level of binary tree traversal. (9) in the main function in the design of a simple menu, respectively, the above algorithm debugging.
Date : 2025-07-03 Size : 315kb User : jack