Akamai Interview Report
- 0of 0 votes
Answersyou 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 - 0of 0 votes
AnswersWhich one you prefer and why?
- yogi.rulzz July 23, 2013 in India
Vector of pointer,reference and object. which one you will prefer.| Report Duplicate | Flag | PURGE
Akamai SDE-2 C++
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.