forked from jainaman224/Algo_Ds_Notes
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tree_Postorder_Traversal.kt
59 lines (53 loc) · 1.16 KB
/
Tree_Postorder_Traversal.kt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
import java.util.*
class Node<Int>(
var key:Int,
var left:Node<Int>? = null,
var right:Node<Int>? = null
)
{
fun postorderTraversal()
{
left?.postorderTraversal()
right?.postorderTraversal()
print("$key ")
}
}
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("Post Order traversal of tree is ")
nodes[0].postorderTraversal()
}
/*
*Enter the size of Array:
*7
*Enter the array respresentaion of binary tree
*1
*2
*3
*4
*5
*6
*-1
*Post Order traversal of tree is 4 5 2 6 3 1
*/