binary tree造句
31. The optimal problem is represented by an AND/OR tree and its optimal objective becomes to find the binary tree whose ratio of the area is maximum.
32. The concurrent version method with the structure of directed binary tree is adopted in order to preserve the intention of an operation resulted from concurrent operations.
33. In this paper, a new coding scheme was proposed, which was based on the sequence of its complete binary tree.
34. This scheme adapts service group to classify group members and uses complete binary tree scheme to update the key that encrypt single data stream in service group.
35. This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
36. Balanced binary tree data structure is a very important concept.
37. First, the workflow with binary tree structures is modeled to substitute sub trees without optional structures with equivalent nodes.
38. Combined with complete binary tree architecture, a new identity-based group key agreement protocol is proposed in this paper.
39. By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.
40. In route search, I make use of the binary tree to simplify the procedure.
41. The article presents the recursive and non-recursive algorithms of postorder -traversing binary tree.
42. A binary tree muting topology is designed for propagating the system clock and trigger signal and the accurate timing and synchronization between sensors are provided by CPLD.
43. Heap is an important binary tree structure often used in applications concerned with priority queues and partial ordering such as Sorting, Shortest Paths, Task Schedule, and Minimum Spanning Tree.
44. As input sequences are the preorder, inorder and postorder of a binary tree, we give the discussion about creating the tree to all conditions.
12