Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create Tree_Preorder_Traversal.kt #2585

Merged
merged 2 commits into from
Apr 1, 2020
Merged

Create Tree_Preorder_Traversal.kt #2585

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
7c91165
Create Tree_Preorder_Traversal.kt
PrachieNaik Mar 22, 2020
bb5e95e
Update Tree_Preorder_Traversal.kt
PrachieNaik Mar 28, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
50 changes: 50 additions & 0 deletions Tree_Preorder_Traversal/Tree_Preorder_Traversal.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,50 @@
import java.util.*
class Node<Int>(
var key:Int,
var left:Node<Int>? = null,
var right:Node<Int>? = null
)
{
fun preorderTraversal()
{
print("$key ")
left?.preorderTraversal()
right?.preorderTraversal()
}
}

fun main() {
var read = Scanner(System.`in`)
println("Enter the size of Array:")
val arrSize = read.nextLine().toInt()
var arr = IntArray(arrSize)
val nodes = mutableListOf<Node<Int>>()
println("Enter the array respresentaion of binary tree")
for(i in 0 until arrSize)
{
arr[i] = read.nextLine().toInt()
nodes.add(Node(arr[i]))
}
for(i in 0..arrSize-2)
{
if((i*2)+1<arrSize && arr[(i*2)+1]!=-1)
nodes[i].left = nodes[(i*2)+1]
if((i*2)+2<arrSize && arr[(i*2)+2]!=-1)
nodes[i].right = nodes[(i*2)+2]
}
print("Pre Order traversal of tree is ")
nodes[0].preorderTraversal()
}
/*
*Enter the size of Array:
*7
*Enter the array respresentaion of binary tree
*1
*2
*3
*4
*5
*-1
*7
*Pre Order traversal of tree is 1 2 4 5 3 7
*/