Java Two fork tree recursive traversal algorithm

2. //recursive middle sequence traversal
4. public void Inorder () {
6. System.out.print ("binarytree recursive middle Sequence Traversal:");
8. Inordertraverserecursion (root);
10. System.out.println ();
12. }
16. //Hierarchical Traversal
18. public void Layerorder () {
20. System.out.print ("Binarytree hierarchy Traversal:");
22. linkedlist<node<integer>> queue = new linkedlist<node<integer>> ();
24. Queue.addlast (root);
26. node<integer> current = null;
28. While (!queue.isempty ()) {
30. Current = Queue.removefirst ();
32. if (current.getleftchild () = null)
34. Queue.addlast (Current.getleftchild ());
36. if (current.getrightchild () = null)
38. Queue.addlast (Current.getrightchild ());
40. System.out.print (Current.getvalue ());
42. }
44. System.out.println ();
46. }
52. //Get two fork tree depth
54. public int getdepth () {
56. return getdepthrecursion (root);
58. }
62. private int getdepthrecursion (node<integer> Node) {
64. if (node = = null)
66. return 0;
68. int llen = getdepthrecursion (Node.getleftchild ());
70. int rlen = getdepthrecursion (Node.getrightchild ());
72. int maxlen = Math.max (Llen, Rlen);
74. return maxlen + 1;
76. }
78. //Recursive First order traversal
80. public Void Preorder () {
82. System.out.print ("Binarytree recursive First Order traversal:");
84. Preordertraverserecursion (root);
86. System.out.println ();
88. }

Java Two fork tree recursive traversal algorithm