与‘数据结构-二叉树’有关的日志

uva1592

maksyuki 发表于 oj 分类,标签: ,
0
uva1592

Peter studies the theory of relational databases. Table in the relational database consists of values that are arranged in rows and columns.

There are different normal forms that database may adhere to. Normal forms are designed to minimize the red >>继续阅读

uva839

maksyuki 发表于 oj 分类,标签:
0
uva839

Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of mobile is usually found hanging over cradles of small babies.

The figure illustrates a simple mobile. >>继续阅读

uva699

maksyuki 发表于 oj 分类,标签:
0
uva699

Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing happened to binary trees, how large would the piles >>继续阅读

uva678

maksyuki 发表于 oj 分类,标签:
0
uva678

A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visits a non-terminal node. It then keeps moving down, either follows the path of the left subtree, or follows the p >>继续阅读

uva548

maksyuki 发表于 oj 分类,标签:
0
uva548

You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum of values of nodes along that path.

Input

The i >>继续阅读

uva122

maksyuki 发表于 oj 分类,标签:
0
uva122

Background

Trees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fundamental to many algorithms in computer graphics >>继续阅读