- String
- Longest common subsequence
- longest increasing subsequence
- longest common substring
- edit distance
- Graphs
- bellman ford
- floyd's all pair shortest
- chain matrix multiplication
- subset sum
- 0/1 knapsack
- Travelling salesman problem
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
publicvoidinorder(Node root){if(root==null){return;} inorder(root.left); System.out.print(root.data+","); inorder(root.right);}publicvoidpreOrder(Node root){if(root==null){return;} System.out.print(root.data+","); preOrder(root.left); preOrder(root.right);}publicvoidpostOrder(Node root){if(root==null){return;} postOrder(root.left); postOrder(root.right); System.out.print(root.data+",");}
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
publicvoidinorder(Node root){if(root==null){return;} inorder(root.left); System.out.print(root.data+","); inorder(root.right);}publicvoidpreOrder(Node root){if(root==null){return;} System.out.print(root.data+","); preOrder(root.left); preOrder(root.right);}publicvoidpostOrder(Node root){if(root==null){return;} postOrder(root.left); postOrder(root.right); System.out.print(root.data+",");}
Comments
Post a Comment