Post a new discussion

Hey, I have shared my campus interview experience with DevTown for SDE - 1.

Hope this helps!

Interview experience link with approach

Hey Ninjas!

This is a post to ask doubts and share your logic for solving questions from SASI Institute of Technology & Engineering x Python Language Coding Contest! 😄

If you face any issues during the contest, do let us know by replying below. ✌️

How was your experience in the contest or got any feedback? Let us know here (link)

Hey, I have shared my campus interview experience with Nagarro for SDE - Intern.

Hope this helps!

Interview experience link with approach

void inorder(BinaryTreeNode<int>* root, int &count) {

    if (root == NULL) {

        return;

    }

    inorder(root->left, count);

    // Leaf Node:

    if(root->left == NULL && root->right == NULL){

        count++;

    }

    inorder(root->right, count);

}

int noOfLeafNodes(BinaryTreeNode<int> *root){

    int count = 0;

    inorder(root, count);

    return count;

}

Hey, I have shared my campus interview experience with Delloitte for Analyst.

Hope this helps!

Interview experience link with approach

Hey Ninjas!

This is a post to ask doubts and share your logic for solving questions from SASI Institute of Technology & Engineering x C++ Language Coding Contest! 😄

If you face any issues during the contest, do let us know by replying below. ✌️

How was your experience in the contest or got any feedback? Let us know here (link)

void postorder(TreeNode* root, vector<int> &ans) {

    if (root == NULL) {

        return;

    }

    postorder(root->left, ans);

    postorder(root->right, ans);

    ans.push_back(root->data);

}

vector<int> postorderTraversal(TreeNode* root)

{

    vector<int> ans;

    postorder(root, ans);

    return ans;

}

DUBAI POWERFULL 100%  SANDAWANA OIL FOR MONEY, BOOST BUSINESS +27639132907 CUSTOMER ATTRACTION, INCOME INCREASE,JOB PROMOTION,STOP BAD LUCK ,FOR CHURCH LEADERS TO GET CHURCH POWER, WIN COURT CASES,PASS EXAMS, BRING BACK LOST LOVER,STOP BAD LUCK,,SALARY INCREASE , WIN TANDERS,WIN COURT CASES,WIN LOTTO,CASINO,POWERBALL IN DUBAI,KUWAIT,BOTSWANA,SOUTH AFRICA,USA,CANADA,UK,AUSTRALIA #oil #business #dubai #leaders #canada #power #power #money #job #southafrica

#include <bits/stdc++.h>  /************************************************************

   Following is the BinaryTreeNode class structure

   template <typename T>    class BinaryTreeNode {       public:        T val;        BinaryTreeNode<T> *left;        BinaryTreeNode<T> *right;

       BinaryTreeNode(T val) {            this->val = val;            left = NULL;            right = NULL;        }    };

************************************************************/ vector<int> getLevelOrder(BinaryTreeNode<int> *root) {    vector<int> result; // To store the level order traversal    if (root == nullptr) {        return result; // Return an empty vector for an empty tree    }

   queue<BinaryTreeNode<int>*> q;    q.push(root);

   while (!q.empty()) {        int levelSize = q.size(); // Number of nodes at the current level        for (int i = 0; i < levelSize; i++) {            BinaryTreeNode<int>* temp = q.front();            q.pop();            result.push_back(temp->val); // Add the node's value to the result

           if (temp->left) {                q.push(temp->left);            }            if (temp->right) {                q.push(temp->right);            }        }    }

   return result; // Return the level order traversal result }