Binary Tree Research Papers - Academia.edu (original) (raw)

Abstract. The restricted rotation distance dR(S, T) between two binary trees S, T of n vertices is the minimum number of rotations by which S can be transformed into T, where rotations can only take place at the root of the tree, or at... more

Abstract. The restricted rotation distance dR(S, T) between two binary trees S, T of n vertices is the minimum number of rotations by which S can be transformed into T, where rotations can only take place at the root of the tree, or at the right child of the root. A sharp upper bound ...

Abstract-We describe a sequential universal data compression procedure for binary tree sources that performs the “double mixture.” Using a context tree, this method weights in an ef-ficient recursive way the coding distributions... more

Abstract-We describe a sequential universal data compression procedure for binary tree sources that performs the “double mixture.” Using a context tree, this method weights in an ef-ficient recursive way the coding distributions corresponding to all bounded memory tree sources, and ...

This paper develops the multidimensional binary search tree (or k -d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k -d tree is defined... more

This paper develops the multidimensional binary search tree (or k -d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k -d tree is defined and examples are given. It is shown to be quite efficient in its storage requirements. A significant advantage of this structure is that a single data structure can handle many types of queries very efficiently. Various utility algorithms are developed; their proven average running times in an n record file are: insertion, O (log n ); deletion of the root, O ( n ( k -1)/ k ); deletion of a random node, O (log n ); and optimization (guarantees logarithmic performance of searches), O ( n log n ). Search algorithms are given for partial match queries with t keys specified [proven maximum running time of O ( n ( k - t )/ k )] and for nearest neighbor queries [empirically observed average running time of O (log n ).] These performances far surpass the b...

We present an algorithm for the Merkle tree traversal problem which combines the efficient space-time trade-off from the fractal Merkle tree [3] and the space efficiency from the improved log space-time Merkle trees traversal [8]. We give... more

We present an algorithm for the Merkle tree traversal problem which combines the efficient space-time trade-off from the fractal Merkle tree [3] and the space efficiency from the improved log space-time Merkle trees traversal [8]. We give an exhaustive analysis of the space and time efficiency of our algorithm in function of the parameters H (the height of the Merkle tree) and h (h = H L where L is the number of levels in the Merkle tree). We also analyze the space impact when a continuous deterministic pseudo-random number generator (PRNG) is used to generate the leaves. We further program a low storage-space and a low time-overhead version of the algorithm in Java and measure its performance with respect to the two different implementations cited above. Our implementation uses the least space when a continuous PRNG is used for the leaf calculation.

Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of... more

Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of domination cover pebbling, obtained by ...

In this paper, a new representation of a binary tree is introduced, called the Catalan Cipher Vector, which is a vector of n elements with certain properties. It can be ranked using a special form of the Catalan Triangle designed for this... more

In this paper, a new representation of a binary tree is introduced, called the Catalan Cipher Vector, which is a vector of n elements with certain properties. It can be ranked using a special form of the Catalan Triangle designed for this purpose. It is shown that the vector coincides with the level-order traversal of the binary tree and how it can be used to generate a binary tree from it. Streamlined algorithms for directly obtaining the rank from a binary tree and vice versa, using the Catalan Cipher Vector during the processes, are given. The algorithms are analyzed for time and space complexity and shown to be linear for both.
The Catalan Cipher Vector enables a straightforward determination of the position and linking for every node of the binary tree, since it contains information for both every node’s ancestor and the direction of linking from the ancestor to that node. Thus, it is especially well suited for binary tree generation. Using another structure, called a canonical state-space tableau, the relationship between the Catalan Cipher Vector and the level-order traversal of the binary tree is explained.

Abstract. In today's society the exploration of one or more databases to extract information or knowledge to support management is a critical success factor for an organization. However, it is well known that several problems can... more

Abstract. In today's society the exploration of one or more databases to extract information or knowledge to support management is a critical success factor for an organization. However, it is well known that several problems can affect data quality. These problems have a ...

LAPORAN PRAKTIKUM 6 ALGORITMA STRUKTUR DATA-TREE
UNIVERSITAS NEGERI MALANG
S1 PENDIDIKAN TEKNIK INFORMATIKA 2016

Notas de Docencia de Algoritmos y Estructuras de Datos

The present paper discusses radio monitoring tasks and their solution using DFT-modulated filter banks. Filter bank software-hardware implementations are studied on the basis of Central Processing Unit (CPU) and Compute Unified Device... more

The present paper discusses radio monitoring tasks and their solution using DFT-modulated filter banks. Filter bank software-hardware implementations are studied on the basis of Central Processing Unit (CPU) and Compute Unified Device Architecture (CUDA) with the use of Graphics Processing Unit (GPU). It is shown that CUDA technology is efficient for processing large datasets and outperforms computational results on CPU. The paper also considers signal classification in real time for different signal-to-noise ratios using a binary tree together with the iterative AdaBoost technique. Experiments show that it is possible to reach the total classification error of 10% for signals handled in radio monitoring tasks.

We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce the heterogeneity of the data... more

We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce the heterogeneity of the data within the new subsamples. During the second stage (pruning), consideration is given to whether adjacent nodes can be aggregated. Finally, during the third stage (joining), similar clusters are joined together, even if they do not share the same parent originally. Consistency results are obtained, and the procedure is used on simulated and real data sets.

There are three classical algorithms to visit all the nodes of a binary tree - preorder, inorder and postorder traversal. From this one gets a natural labelling of the internal nodes of a binary tree by the numbers , indicating the... more

There are three classical algorithms to visit all the nodes of a binary tree - preorder, inorder and postorder traversal. From this one gets a natural labelling of the internal nodes of a binary tree by the numbers , indicating the sequence in which the nodes are visited. For given (size of the tree) and (a number between 1 and

In this paper, a new algorithm to find convex hull is presented which keeps the points into a form of nested binary tree. There are number of methods available for finding the convex hull but all of them are time consuming because they... more

In this paper, a new algorithm to find convex hull is presented which keeps the points into a form of nested binary tree. There are number of methods available for finding the convex hull but all of them are time consuming because they are based on comparing distances between the points and rotation of angles, whereas the proposed technique is based on binary tree which is efficient and more accurate than the existing algorithms as it decreases the computational cost and finds precise boundary of the object. Another main advantage of the proposed technique is the efficient memory usage because of binary tree structure.