Divide and Conquer Problems in JAVA

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:- Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60 https://leetcode.com/list/5eie1aqd/ Must do medium:- https://leetcode.com/list/5xaelz7g/ Must do Easy:- https://leetcode.com/list/5r7rxpr1/ Graph:- https://leetcode.com/list/x18ervrd/ Dynamic Programming:- https://leetcode.com/list/x14z0dxr/ FaceBook interviews:- https://leetcode.com/list/xyu98pv6/ Amazon Interviews:- https://leetcode.com/list/5hkniyf7/ Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md

Tree Traversal in JAVA (InOder/preOrder/postOrder)

Tree Traversal in JAVA (InOder/preOrder/postOrder):- Tree traversal can be done through three ways. 1)Inorder:- Go recursively to the left node. Read a node Go recursively to the right node. 2)Pre Order. Read a node Go recursively to the left node. Go recursively to the right node. 2)Post Order. Go recursively to the left node. Go recursively to the right node. Read a node public void inorder ( Node root ) { if ( root == null ) { return ; } inorder ( root . left ); System . out . print ( root . data + "," ); inorder ( root . right ); } public void preOrder ( Node root ) { if ( root == null ) { return ; } System . out . print ( root . data + "," ); preOrder ( root . left ); preOrder ( root . right ); } public void postOrder ( Node root ) { if ( root == null ) { return ; } postOrder ( root . left ); postOrder ( root . right ); Sy

Concepts of Computer Science

Search This Blog