Question

Consider a tertiary tree (3-ary tree where each node can have atmost three children). This tree
is stored as an array and read from a file tree.dat. A null node is indicated by -1. This file
contains a sequence of integers separated by blank. Here, -100 is used as terminator of
sequence. For this tree, implement post-order traversal
(i) recursively and
(ii) non-recursively.

Answer 1

Answer:

iska answer mujhe nahin pata hai