搜索资源列表
Twoforktrees
- 二叉树操作,掌握指针变量的含义,二叉树的结构特征,以及各种存储结构的特点及使用范围;指针类型描述、访问和处理二叉树的运算。程序1: 按先序次序输入二叉树中结点的值(一个字符),`0`表示空树,生成二叉树的二叉链表存储结构, a为指向根结点的指针。然后按中序顺序遍历二叉树。算法思想:先访问左子树,再访问根结点,最后访问右子树。-binary tree operation, grasp the meaning indicator variables, binary tree structure, a
tree
- 算术表达式与二叉树之间存在着对应关系,编写把以前缀形式输入的合法算术表达式转换为中缀表达式,再转换为后缀表达式,并求表达式的值-Arithmetic expressions with binary tree there is a correlation between the preparation of the form to enter the legitimate prefix arithmetic expression conversion infix expression, and t
calc
- 在以二叉树表示算术表达式的基础上,设计一个十进制的四则运算的计算器。[设计要求]实现整数浮点数的四则运算,并且还加上了^的运算,支持括号及开始的负数-In a binary arithmetic expression that is designed based on a four decimal arithmetic calculator. [Design requirements] to achieve a four-integer floating-point arithmetic, an
1
- 1)使用先序遍历序列构造算法,使用二叉链表,表示算术表达式2*3+6/3的标识符树; 2)求标识符树的先序、中序、后序序列,各存入数组中并显示结果; 3) 求树中叶子结点的个数 附加:3)使用后序序列求表达式的值(使用栈实现); -1) Use a preorder traversal sequence construction algorithm, using the linked list of binary, indicating that the arithmetic
BST
- 用二叉链表实现二叉排序树的各个基本运算的算法,包括建表、查找,插入,删除,树的输出表示等-Binary sort tree binary list basic arithmetic algorithms, including the construction of the table, find, insert, delete, output representation of the tree
shujujiegou
- 数据结构实验,包含多个程序:二叉排序树,二叉树,哈夫曼编译码器,哈希表,马踏棋盘,魔王语言,树的遍历,双循环链表,顺序队列,图的遍历,一元稀疏多项式运算器,约瑟夫杯,折半查找,综合实验-Experimental data structure that contains more than one program: binary sort tree, binary tree, Huffman codec, hash tables, horse riding board, devil languag
Texpression
- 一个表达式和一棵二叉树之间存在着自然的对应关系,写一个程序,实现基于二叉树表示的算术表达式Expression的操作-An expression and a binary tree between there is a natural correspondence between write a program based on binary tree arithmetic expression Expression operation
code
- 使用回溯法解决的典型问题的算法:骑士巡游问题,n皇后问题,0-1背包问题。 使用递归与分治策略解决的几个问题的算法:Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
1
- 一个比较新颖的思路将运算表达式转换为二叉树,支持括号,若需要支持其他复杂符号扩展也比较容易。-A relatively new idea will be converted to binary arithmetic expression, support brackets, but also relatively easy if you need to support other complex sign extension.