the experiment in this study was conducted as a completely randomized block design with ten treatments and four replications. treatments included: to- control, t1- 50g of zn per tree as broadcast application, t2-100g zn per tree, broadcast application, t3- 200g zn per tree as broadcast application, t4- 50 g zn per tree as band application, t5- 50g zn per tree, band application, t6-100g zn per t...

Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

the traditional event tree analysis uses a single probability to represent each top event. however, it is unrealistic to evaluate the occurrence of each event by using a crisp value without considering the inherent uncertainty and imprecision a state has. the fuzzy set theory is universally applied to deal with this kind of phenomena. the main purpose of this study is to construct an easy metho...

The importance of shea tree to the people of south-western Nigeria cannot be over emphasized considering both the economic and environmental uses of the tree. However, efforts have not been made to propagate its production by the farmers as the shea tree still grows in the wild state. It would be worthwhile to investigate farmers’ perception of shea nut tree as an economic tree and their attitu...

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...