搜索资源列表
Gen
- 2元方程的求根的java实现，用组合框完成-two yuan Solving the equation of java realized, complete with box mix
4
- 哈夫曼编码是一种编码方式，它是根据每一个字符出现的概率而建立起来的。哈夫曼编码借助树形结构构造，算法实现时使用链表或静态链表结构，空间的每个结点内有左子树、右子树、双亲指针。在构成哈夫曼树之后，为求编码需从叶子结点出发走一条从叶子到根的路径；而为译码需从根出发走一条从根到叶子的路径。
Power-builder
- 此文档列举在powerBuilder中用到的登录界面，求回文，检索功能，求素数，求一元二次方程的根的相关代码-This document lists the powerBuilder used in the login screen, find the palindrome, search function, find the prime numbers, find the root of a quadratic equation the relevant code
ti
- 间的对话框求一元二次方程的根 用vs编写的-Between the dialog box to seek the root of a quadratic equation written using vs
6-44
- 编写递归算法：求二叉树中以元素值为x的节点为根的子树的深度-Write a recursive algorithm: the value of an element in the binary tree node x is the depth of the subtree rooted