iSharkFly-Docs/java-tutorials
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Revering tree update (#6561)

Browse Source 
* Add files via upload

* Add files via upload

* Add files via upload

* Add files via upload

* Add files via upload
This commit is contained in:
soufiane-cheouati 2019-04-03 17:27:36 +00:00 committed by Grzegorz Piwowarek
parent 871ee3ccce
commit b7fbf839f9
3 changed files with 142 additions and 143 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/reversingtree/TreeNode.java
View File

@ -30,7 +30,7 @@ public class TreeNode {
this.leftChild = leftChild; this.leftChild = leftChild;
} }
public TreeNode(int value, TreeNode rightChild, TreeNode leftChild) { public TreeNode(int value, TreeNode leftChild, TreeNode rightChild) {
this.value = value; this.value = value;
this.rightChild = rightChild; this.rightChild = rightChild;
this.leftChild = leftChild; this.leftChild = leftChild;

15
algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/reversingtree/TreeReverser.java
View File

@ -4,21 +4,6 @@ import java.util.LinkedList;
public class TreeReverser { public class TreeReverser {
public TreeNode createBinaryTree() {
TreeNode leaf1 = new TreeNode(3);
TreeNode leaf2 = new TreeNode(1);
TreeNode leaf3 = new TreeNode(9);
TreeNode leaf4 = new TreeNode(6);
TreeNode nodeLeft = new TreeNode(2, leaf1, leaf2);
TreeNode nodeRight = new TreeNode(7, leaf3, leaf4);
TreeNode root = new TreeNode(4, nodeRight, nodeLeft);
return root;
}
public void reverseRecursive(TreeNode treeNode) { public void reverseRecursive(TreeNode treeNode) {
if (treeNode == null) { if (treeNode == null) {
return; return;

18
algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/reversingtree/TreeReverserUnitTest.java
View File

@ -10,7 +10,7 @@ public class TreeReverserUnitTest {
public void givenTreeWhenReversingRecursivelyThenReversed() { public void givenTreeWhenReversingRecursivelyThenReversed() {
TreeReverser reverser = new TreeReverser(); TreeReverser reverser = new TreeReverser();
TreeNode treeNode = reverser.createBinaryTree(); TreeNode treeNode = createBinaryTree();
reverser.reverseRecursive(treeNode); reverser.reverseRecursive(treeNode);
@ -22,7 +22,7 @@ public class TreeReverserUnitTest {
public void givenTreeWhenReversingIterativelyThenReversed() { public void givenTreeWhenReversingIterativelyThenReversed() {
TreeReverser reverser = new TreeReverser(); TreeReverser reverser = new TreeReverser();
TreeNode treeNode = reverser.createBinaryTree(); TreeNode treeNode = createBinaryTree();
reverser.reverseIterative(treeNode); reverser.reverseIterative(treeNode);
@ -30,4 +30,18 @@ public class TreeReverserUnitTest {
.trim()); .trim());
} }
private TreeNode createBinaryTree() {
TreeNode leaf1 = new TreeNode(1);
TreeNode leaf2 = new TreeNode(3);
TreeNode leaf3 = new TreeNode(6);
TreeNode leaf4 = new TreeNode(9);
TreeNode nodeRight = new TreeNode(7, leaf3, leaf4);
TreeNode nodeLeft = new TreeNode(2, leaf1, leaf2);
TreeNode root = new TreeNode(4, nodeLeft, nodeRight);
return root;
}
} }