搜索资源列表
lxshu
- 用汇编语言编写的二叉树排列算法，我自己的汇编课程设计之一-assembler language with the binary tree algorithm, a compilation of my own design one of the courses
BiTree
- 1.构建二叉树 2.编写递归算法，交换二叉树的左右子树； 3.输出按先序遍历得到的新二叉树结果。 -1 build a binary tree 2 write a recursive algorithm, exchange the left and right binary subtree 3 preorder traversal of the output obtained by a new binary tree results.
-binary-tree
- 本文介绍了二叉树的定义、性质及存储方式，各种遍历算法。 以及求所有叶子及结点总数。-This article describes the definition, nature and storage of binary tree, various traversal algorithm. And the demand of all the leaves and the total number of nodes.
bitree
- 编写递归算法，在二叉树中求位于先序序列中第k个位置的结点的值- Write a recursive algorithm, and seeking in the first sequence binary sequence of k-th position of the value of a node
3_1
- 若用二叉链表作为二叉树的存储表示，试针对以下问题编写递归算法： 统计二叉树中叶结点的个数。 -If using the binary tree as a binary tree stores that try to prepare for the following recursive algorithm: Statistics mid-binary number of nodes.
tree
- 树的相关操作，先序遍历建立二叉链表，左右孩子交换，二叉树中叶子节点个数算法，统计以值为x的结点为根的子树中叶子结点的数目，按树状打印二叉树-Tree-related operations, first traversal establishment of binary list, so the child exchange, the number of leaf nodes in a binary tree algorithm, the statistical value of x to a n
kong-jian-shu-ju
- 一棵具有n个节点的完全二叉树以顺序方式存储在数组A中。设计一个算法构造该二叉树的二叉链存储结构。-Complete binary tree with n nodes in a sequential manner are stored in the array A. Design an algorithm constructed binary chain storage structure of the binary tree.
1
- 用C语言实现二叉树的先序、中序和后序的递归算法。-Using C language binary tree recursive algorithm first sequence, sequence and subsequent of.
二叉链表
- 一、 实验目的 (一) 掌握二叉树的逻辑结构和二叉链表存储结构; (二) 验证二叉树的二叉存储和遍历及其基本操作的实现; (三) 理解算法与程序的关系，能够将顺序表算法转化为对应程序;(First, the purpose of the experiment (1) master the logical structure of the two tree and the storage structure of the two linked list; (two) verify the