-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTreeUtil.java
More file actions
66 lines (59 loc) · 1.16 KB
/
TreeUtil.java
File metadata and controls
66 lines (59 loc) · 1.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package code.tree;
import java.util.ArrayDeque;
import java.util.Queue;
public class TreeUtil {
/**
* 先序遍历
*
* @param root
*/
public static void preOrderTraversal(Node root) {
if (root == null)
return;
System.out.println(root.val);
preOrderTraversal(root.left);
preOrderTraversal(root.right);
}
/**
* 中序遍历
*
* @param root
*/
public static void inOrderTraversal(Node root) {
if (root == null)
return;
inOrderTraversal(root.left);
System.out.println(root.val);
inOrderTraversal(root.right);
}
/**
* 后序遍历
*
* @param root
*/
public static void postOrderTraversal(Node root) {
if (root == null)
return;
postOrderTraversal(root.left);
postOrderTraversal(root.right);
System.out.println(root.val);
}
/**
* 层序遍历
*
* @param root
*/
public static void levelTraversal(Node root) {
Queue<Node> queue = new ArrayDeque<Node>();
queue.offer(root);
Node current = null;
while (!queue.isEmpty()) {
current = queue.poll();
System.out.println(current.val);
if (current.left != null)
queue.offer(current.left);
if (current.right != null)
queue.offer(current.right);
}
}
}