二叉树创建

创建二叉树的节点：

1. public class TreeNode {

2. int val;

3. TreeNode left;

4. TreeNode right;

5. TreeNode(int x) {

6. val = x;

7. }

8. public TreeNode(){}

9. }

创建二叉树并遍历：

1. public class Test {

2. public static void main(String[] args) {

3. String [] str = {"1","2","3"};

4. TreeNode treeNode = create(str);

5. System.out.print("先序遍历：");

6. pre(treeNode);

7. System.out.println();

8. System.out.print("中序遍历：");

9. mid(treeNode);

10. System.out.println();

11. System.out.print("后序遍历：");

12. rear(treeNode);

13. System.out.println();

14. System.out.println("层次遍历：");

15. level(treeNode);

16. }

17.  

18. /**

19. * 创建二叉树

20. * @param arr

21. * @return

22. */

23. public static TreeNode create( String [] arr){

24. if(arr.length == 1){

25. return new TreeNode(Integer.valueOf(arr[0]));

26. }

27. TreeNode [] brr = new TreeNode[arr.length];

28. for (int i = 0; i < arr.length; i++) {

29. if(arr[i] != null) {

30. brr[i] = new TreeNode(Integer.valueOf(arr[i]));

31. }

32. }

33. for (int i = 0; i < (( brr.length / 2) - 1); i++) {

34. if(brr[i] != null){

35. TreeNode left = brr[2 * i + 1];

36. TreeNode right = brr[2 * i + 2];

37. brr[i].left = left;

38. brr[i].right = right;

39. }

40. }

41.  

42. int size = arr.length;

43. int end =size / 2 -1;

44. if(size % 2 == 0){

45. brr[end].left = brr[end * 2 + 1];

46. }else{

47. brr[end].left = brr[end * 2 + 1];

48. brr[end].right = brr[end * 2 + 2];

49. }

50. return brr[0];

51. }

52.  
53.  

54. /**

55. * 先序遍历

56. */

57. public static void pre(TreeNode treeNode){

58. if(treeNode == null){

59. return;

60. }

61. System.out.print(treeNode.val + " ");

62. pre(treeNode.left);

63. pre(treeNode.right);

64. }

65.  

66. /**

67. * 中序遍历

68. */

69. public static void mid(TreeNode treeNode){

70. if(treeNode == null){

71. return;

72. }

73. mid(treeNode.left);

74. System.out.print(treeNode.val + " ");

75. mid(treeNode.right);

76. }

77.  

78. /**

79. * 后续遍历

80. */

81. public static void rear(TreeNode treeNode){

82. if(treeNode == null){

83. return;

84. }

85. rear(treeNode.right);

86. rear(treeNode.left);

87. System.out.print(treeNode.val + " ");

88. }

89.  

90. /**

91. * 层次遍历

92. */

93. public static void level(TreeNode treeNode){

94. if(treeNode == null){

95. return;

96. }

97. List<TreeNode> list = new ArrayList<>();

98. list.add(treeNode);

99. while(list.size() > 0){

100. List<TreeNode> tempList = new ArrayList<>();

101. for (TreeNode node : list) {

102. System.out.print(node.val + " ");

103. if(node.left != null){

104. tempList.add(node.left);

105. }

106. if(node.right != null){

107. tempList.add(node.right);

108. }

109. }

110. System.out.println();

111. list.clear();

112. list = tempList;

113. }

114. }

115.  

116. }

运行结果：