ScholarLens Back to search
2017•Journal of Harmonized Research in EngineeringRequires access

INORDER AND PREORDER TRAVERSAL and DISPLAY OF EXISTING BINARY TREE IN COMPUTER MEMORY

P K Kumaresan

Open publisher page 0 citations

Abstract

Depending on three different sequences of traversal of a binary tree, we get its preorder, postorder and inorder form. Similarly depending on preorder or postorder along with inorder, the binary tree can be formed. In this paper, we try to implement, through coding a binary tree is formed physically not virtually in computer memory and also give a realistic view of a binary tree, already created in computer memory. Using inorder and preorder traversal of binary tree and takes the value of the level of the tree we are able to graphically represent any binary tree. Keywords: Binary Tree, Inorder, Preorder, Link List, Structure Pointer, Recursive Function, Data Structure.

About this research paper

What this paper is about

Depending on three different sequences of traversal of a binary tree, we get its preorder, postorder and inorder form. Similarly depending on preorder or postorder along with inorder, the binary tree can be formed. In this paper, we try to implement, through coding a binary tree is formed physically not virtually in computer memory and also give a realistic view of a binary tree, already created in computer memory. Using inorder and preorder traversal of binary tree and takes the value of the level of the tree we are able to graphically represent any binary tree. Keywords: Binary Tree, Inorder, Preorder, Link List, Structure Pointer, Recursive Function, Data Structure.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Depending on three different sequences of traversal of a binary tree, we get its preorder, postorder and inorder form. Similarly depending on preorder or postorder along with inorder, the binary tree can be formed. In this paper, we try to implement, through coding a binary tree is formed physically not virtually in computer memory and also give a realistic view of a binary tree, already created in computer memory. Using inorder and preorder traversal of binary tree and takes the value of the level of the tree we are able to graphically represent any binary tree. Keywords: Binary Tree, Inorder, Preorder, Link List, Structure Pointer, Recursive Function, Data Structure.

Key concepts: Preorder, Tree traversal, Binary tree, Computer science, Tree (set theory), Pointer (user interface), Binary number, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
INORDER AND PREORDER TRAVERSAL and DISPLAY OF EXISTING BINARY TREE IN COMPUTER MEMORY — Research Paper | ScholarLens