MAGMA Interview Question Software Engineer / Developers
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
1. For binary tree, node structure will be
struct node
{
int data;
struct node *left;
struct node *right;
}
2. But our special tree is not Binary Tree .
3. A is a tree root node and it can have ZERO to INFINITY childrens.
Let us assume B, C, D, E,F,G are childrens of A.
4. Now B can have any number childrens . similarly Other children nodes also.
5. diagram representation of tree
A / / / | \ \ \ B C D E F G H //| X Y Z ...4. My answer
- siva.sai.2020 February 17, 2011struct node { int data; struct node *child; struct node *sibling; }; 6. Traversal code void PreOrderTraversal( struct node * root ) { if( root == NULL ) { return NULL; } else { printf(" %d \t", root->data ); PreOrderTraversal(root->child); PreOrderTraversal(root->sibling); } }