Bramastra trick

View this post on Instagram A post shared by Bramastra Trick (@bramastratrick)

 C/C++ Notes By Brmastratrick C notes pdf C++ notes pdf Notes:- Iss Notes Ka Detail Video dekhna Chahe hai tho Hamre youtube Channel Bramastra Trick Pe Jaye. C Notes By Brmastratrick Download C++ Notes By Brmastratrick Download

 Super-D tempered glass list  Super X tempered glass list  11D tempered glass list Hello Friends Brmastra trick blog me swagat hai. yeh post dukandar bhaiyo ke liye jo mobile shop chalate hai jo log Temperd Glass bechte hai.iss blog me universal Tempered Glass list dung jo ke ek tempered glass kai model me lag jayega. chahe aap superd superx 11d matbull glass jo bhi bechte ho. Note:- iss List me samaye samaye pe change hote rahte hai updated jankari ke liye mere youtube channel Bramastra Trick ko subscribe kare                                           click to       SUBSCRIBE Note :- Mai list me display size ke anusar dunga aur example ke taur pe ek model ka name likh dunga jisse apko glass kharidne me asani padega. Realme C15 (display size - 6.5 ) Vivo – T1 5g,Y11S,Y12A,Y12S,Y12S 2021,Y15S,Y20,Y2...

 Back / Flip Cover Universal List Hello Friends Brmastra trick blog me swagat hai. yeh post dukandar bhaiyo ke liye jo mobile shop chalate hai jo log cover bechte hai.iss blog me universal cover list dung jo ke ek cover kai model me lag jayega. Note:- iss List me samaye samaye pe change hote rahte hai updated jankari ke liye mere youtube channel Bramastra Trick ko subscribe kare                                           click to       SUBSCRIBE Realme / OPPO  C11 2021/C20/Narzo 50i C21Y / C25Y 5 / 5i / 5S / Narzo 10 Realme 2 / oppo A5/A5S/A7 3 / 3i / 3pro 6 / 6i Realme 2 pro / oppo f9 Realme 7 / narzo 20 pro C2 / A1K C12/C25/NARZO 30A NARZO 20/C15 A3S / C1 F9 / F9 PRO REALME X / K3 A5 2020 / A9 2020 RENO 2Z / 2F OPPO K10 5G / NARZO 50 5G / A57 5G X7 / X7 PRO Relame 8 / 8 4G A76 / A96 / 9i / K10 A92 / A52 ...

IGNOU Exam Form PDF   DOWNLOAD

 Patliputra University MCA Syllabus  B.D College Patna MCA Syllabus DOWNLOAD    

  avl tree implementation in java public class avlTree { class Node{ int data ; Node left ; Node right ; int height ; Node ( int data){ this . data =data ; this . left = null; this . right = null; this . height = 0 ; } } public int getheight (Node n){ if (n== null ) return - 1 ; int lh=getheight(n. left ) ; int rh=getheight(n. right ) ; int fh=Math. max (lh , rh)+ 1 ; return fh ; } public int getbalancefac (Node n){ if (n== null ) return 0 ; return getheight(n. left )-getheight(n. right ) ; } public Node rightRotate (Node a){ Node b=a. left ; Node br=b. right ; b. right =a ; a. left =br ; a. height =Math. max (getheight(a. left ) , getheight(a. right ))+ 1 ; b. height =Math. max (getheight(b. left ) , getheight(b. right ))+ 1 ; return b ; } ...

 searching and deletion in binary search tree java hindi public class binarysearch { class Node{ int data ; Node left ; Node right ; Node ( int data){ this . data =data ; this . left = null; this . right = null; } } public Node addtress (Node root ,int values){ if (root== null ){ return new Node(values) ; } if (values< root. data ){ root. left =addtress(root. left , values) ; } else { root. right =addtress(root. right , values) ; } return root ; } public void inorder (Node root){ if (root== null ) return; inorder(root. left ) ; System. out .print(root. data + " " ) ; inorder(root. right ) ; } public Node search (Node root ,int value){ if (root== null ) return null; if (root. data == value){ return root ; } if (r...

  binary search tree implementation in java hindi public class binarysearch { class Node{ int data ; Node left ; Node right ; Node ( int data){ this . data =data ; this . left = null; this . right = null; } } public Node addtress (Node root ,int values){ if (root== null ){ return new Node(values) ; } if (values< root. data ){ root. left =addtress(root. left , values) ; } else { root. right =addtress(root. right , values) ; } return root ; } public void inorder (Node root){ if (root== null ) return; inorder(root. left ) ; System. out .print(root. data + " " ) ; inorder(root. right ) ; } public static void main (String[] args) { binarysearch bss= new binarysearch() ; Node root= null; root=bss.addtress(root , 10 ) ; root...

 binary tree implementation and traversal in java binary tree preorder,postorder,inorder java code implemenattion by bramastra trick import java.util.Scanner ; public class binarytrees { class Node{ int data ; Node left ; Node right ; Node ( int data){ this . data =data ; this . left = null; this . right = null; } } Scanner sc = new Scanner(System. in ) ; public Node addtree (){ Node root= null; System. out .println( "enter data" ) ; int data= sc .nextInt() ; if (data==- 1 ){ return null; } root= new Node(data) ; System. out .println( "enter left child of root " + data) ; root. left =addtree() ; System. out .println( "enter right child of root " + data) ; root. right =addtree() ; return root ; } public void inorder (Node root){ if (root== null ) retur...

Double-Ended Queue in Data Structure java public class dequeue_ex { int front =- 1 , rear =- 1 ; int size = 5 ; int [] myarr = new int [ size ] ; public void enqueueFront ( int data){ if (( front == 0 && rear ==( size - 1 )) || front == rear + 1 ){ System. out .println( "overflow" ) ; } else if ( front ==- 1 && rear ==- 1 ){ front = rear = 0 ; myarr [ front ]=data ; } else if ( front == 0 ){ front = size - 1 ; myarr [ front ]=data ; } else { front -- ; myarr [ front ]=data ; } } public void enqueuRear ( int data){ if (( front == 0 && rear ==( size - 1 )) || front == rear + 1 ){ System. out .println( "overflow" ) ; } else if ( front ==- 1 && rear ==- 1 ){ front = rear = 0 ; myarr [ rear ]=data ; } ...

  circular queue implementation java public class circ_queue { int front =- 1 , rear =- 1 ; int size = 5 ; int [] arr = new int [ size ] ; public void enqueue ( int data){ if ( front ==( rear + 1 )% size ){ System. out .println( "overflow" ) ; } else { if ( front ==- 1 && rear ==- 1 ){ front ++ ; rear ++ ; arr [ rear ]=data ; } else { rear =( rear + 1 )% size ; arr [ rear ]=data ; } } } public void dequeue (){ if ( front ==- 1 && rear ==- 1 ){ System. out .println( "underflow" ) ; } else if ( front == rear ){ front =- 1 ; rear =- 1 ; } else { front =( front + 1 )% size ; } } public void display (){ if ( front ==- 1 && rear ==- 1 ){ System. ...

  Queue implementation using linkedlist in java public class queue_ll { class Node{ int data ; Node next ; Node ( int data){ this . data =data ; this . next = null; } } Node front = null; Node rear = null; public void enqueue ( int data){ Node toadd= new Node(data) ; if ( front == null ){ front =toadd ; rear =toadd ; } else { rear . next =toadd ; rear =toadd ; } } public void dequeue (){ if ( front == null ){ System. out .println( "underflow" ) ; } else { front = front . next ; } } public void display (){ Node temp= front ; while (temp!= null ){ System. out .println(temp. data ) ; temp=temp. next ; } } public static void main (String[] args) { queue_ll qll= new queue_ll() ; ...

 Queue implementation in Java hindi public class queue_ary { int front =- 1 , rear =- 1 ; int size = 5 ; int [] arr = new int [ size ] ; public void enqueue ( int data){ if ( rear ==( size - 1 )){ System. out .println( "overflow" ) ; } else { if ( front ==- 1 && rear ==- 1 ){ front ++ ; rear ++ ; arr [ rear ]=data ; } else { rear ++ ; arr [ rear ]=data ; } } } public void dequeue (){ if ( front ==- 1 && rear ==- 1 ){ System. out .println( "empty" ) ; } else { for ( int i= 0 ; i< rear ; i++){ arr [i]= arr [i+ 1 ] ; } rear -- ; } } public void display (){ if ( front ==- 1 && rear ==- 1 ){ System. out .println( "empty" ) ; ...

  stack implementation using linked list in java public class linkstack { class Node{ int data ; Node next ; Node ( int data){ this . data =data ; this . next = null; } } Node head = null; int size ; public void push ( int data){ Node newnode= new Node(data) ; size ++ ; if ( head == null ){ head =newnode ; } else { newnode. next = head ; head =newnode ; } } public void pop (){ if ( head == null ){ System. out .println( "underflow" ) ; } else { size -- ; head = head . next ; } } public void display (){ Node temp= head ; if (temp== null ){ System. out .println( "empty" ) ; } while (temp!= null ){ System. out .println(temp. data ) ; temp=temp. next ; } ...