Binary tree traversal refers to the process of visiting each node in a specified order. Given the inorder traversal of a binary tree, along with one of its preorder or postorder traversals, the original binary tree can be uniquely identified. Many recursive and non recursive method of construction of the tree from inorder and any of the postorder or preorder traversal have been proposed. In this paper one of the proposed algorithms has been examined. This algorithm computes the wrong tree for some input sequences. We show a particular situation in which the algorithm fails and a solution for this situation is proposed. The proposed a modified non-recursive algorithm for reconstructing a binary tree which generates the correct tree otherwise an error has been reported.

Grid computing is a kind of distributed computing that involve the integrated and collaborative use of distributed resources. It involves huge amounts of computational task which require reliable resource sharing across computing domains. Load balancing in grid is a technique which distributes the workloads across multiple computing nodes to get optimal resource utilization, minimum time delay, maximize throughput and avoid overload. It is a challenging problem that has been studied extensively is the past several years. This paper attempts to provide a comprehensive overview of load balancing in grid computing environment and also analyses the job distribution and system behavior. Furthermore, this survey various load balancing algorithms for the grid computing environment, identify several comparison metrics for the load balancing algorithms and carry out the comparison based on these identified metrics between them. it also reviews the latest research activities in the area of grid computing, including characteristics, capabilities, architecture, applications, design constraints, scheduling and load balancing and presents a set of challenges and problems.

In grid computing environment, the efficiency of computing node is affected by several factors such as node utilization, allocation of jobs etc. The incoming job is allocated to appropriate node in such a way that the node utilization is maximized and a well-balanced load across all the participating computing nodes that enhances the overall performance of grid computing. This paper presents an amended hybrid approach for scheduling sequential task. The proposed approach uses combination of first-come-firstserved (FCFS) and genetic algorithm (GA). A sliding-window technique is presented to initiate alteration between the FCFS and GA, to offers a rapid task assignment. For GA we initially generate random population and use straightforward encoding. The proposed method is evaluated in the terms of makespan value and node utilization with a varying set of simulation cases and parameters after then it is compared with a well design first-come-first-server (FCFS) and hybrid genetic algorithm (HGA). Experimental results have shown significant improvement compared to the both FCFS and HGA algorithms. The result gives minimized makespan value with increased node utilization for both homogeneous and heterogeneous types of nodes.