Akamai Interview Report
- 0of 0 votes
you have given a post-fix of a binary try in which either you have 0 child(leaf node) or 2 child(internal node).- yogi.rulzz July 23, 2013 in India
one more condition that all internal node are denoted via "i" and leaf node via "l".
we have to create this binary tree with this posfix.
| Report Duplicate | Flag | PURGE
Akamai SDE-2 Algorithm
Open Chat in New Window