LeetCode : Symmetric Tree Problem

By

 


           Problem statement:-

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

           


 

            Solution:-



Comments

Post a Comment

Popular posts from this blog

Leetcode Problem(Easy) Roman to Integer

By
  Roman numerals are represented by seven different symbols:  I ,   V ,   X ,   L ,   C ,   D   and   M . Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example,  2  is written as  II  in Roman numeral, just two ones added together.  12  is written as  XII , which is simply  X + II . The number  27  is written as  XXVII , which is  XX + V + II . Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not  IIII . Instead, the number four is written as  IV . Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as  IX . There are six instances where subtraction is used: I  can be placed before  V  (5) and  X  (10) to make 4 an...
Read more

Sort The Array Using Bubble Sort

By
 package sorting; import java.util.Arrays; import java.util.stream.Collectors; public class BubbleSort { public static void main(String[] args) { int arr[] = { 1, 3, 4, 6, 5, 9, 2, 8, 7 }; int n = arr.length - 1; for (int i = 0; i < n; i++) { int flag = 0; for (int j = 0; j < n - i; j++) { if (arr[j] > arr[j + 1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; flag = 1; } } if (flag == 0) { break; }   } System.out.println(Arrays.stream(arr).boxed().distinct().collect(Collectors.toList())); } }
Read more

Linear Search In Java

By
 package sorting; import java.util.Scanner; public class LinearSearch { public static void main(String[] args) { int arr[] = { 1, 2, 3, 8, 5, 6, 1 }; Scanner sc = new Scanner(System.in); int num = sc.nextInt(); for (int i : arr) { if (i == num) { System.out.println("Found the number " + i); break; } } sc.close(); } }
Read more