Prefix to postfix conversion


Comments

Post a Comment

Popular posts from this blog

Check whether a binary tree is full binary tree or not

Types of binary trees Problem link Code: public class FullBinaryTree {         Node root;         boolean isFullTree(Node node){                 if(node == null)             return true;                 if(node.left == null && node.right == null)             return true;                 if(node.left != null && node.right != null)             return isFullTree(node.left) && isFullTree(node.right);                 return false;                 }      ...
Read more

Rearrange Array in Maximum-Minimum form

Given a sorted array of positive integers, rearrange the array alternately i.e first element should be the maximum value, second minimum value, third-second max, fourth-second min and so on. Naive Solution: Here we will use an auxiliary array to store the elements in correct order. For even indices of the array  Large numbers from the given array are added. For odd indices small numbers are added. Code: import java.util.*; public class Test{        public static void main(String[] args) {          Scanner in = new Scanner(System.in);     int[] a = {1,2,3,4,5,6,7,8,9};     int n = a.length;     int[] temp = new int[n];     int small = 0;     int large = n-1;     for(int i=0; i<n; i++){         if(i%2 == 0){             temp[i] = a[large--];         }  ...
Read more