Teaching Rajasthan Basic Computer Instructor 2021 Mock Test Programming and Data Structure Tree Tree Traversal
Consider the tree T given below. If post order traversal of T gives BCEAD, the lables of nodes 1, 2, 3, 4, 5, respectively are:
1
DEBAC
2
DBEAC
3
EDABC
4
DEABC