FilesExpand file tree

 master

/

Main.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

29 lines (26 loc) · 1006 Bytes

 master

/

Main.java

Copy path

Top

File metadata and controls

• Code
• Blame

29 lines (26 loc) · 1006 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package tree;

import java.util.ArrayList;

import java.util.List;

public class Main {

public static void main(String[] args) {

// offerStructs.TreeNode<Integer> t = new offerStructs.TreeNode<>(1);

// t.addLeft(2);

// t.addRight(3);

// t.leftChild.addLeft(4);

// t.leftChild.addRight(5);

// System.out.println("中序遍历测试:");

// TreeTools.midOrderTravel(t);

// System.out.println();

// TreeTools.midOrderTravelNoRecursion(t);

// System.out.println("\n前序遍历测试:");

// TreeTools.preOrderTravel(t);

// System.out.println();

// TreeTools.midOrderTravelNoRecursion(t);

// System.out.println("\n后序遍历测试:");

// TreeTools.backOrderTravel(t);

// System.out.println();

// TreeTools.BackOrderTravelNoRecursion(t);

char[] list = {'8','8','7','9','2','#','#','#','#','4','5'};

TreeNode<Character> root = TreeTools.CreateBinTreeByArray(list);

}

}