Introduction - If you have any usage issues, please Google them yourself
1. With a one-dimensional array to preserve binary tree nodes. 2. The realization of binary tree nodes to return to the left child, return the right child, add the node 3. Binary tree traversal sequence.
Packet : 11912912erchashushixian.rar filelist
test4\ArrayTree.class
test4\ArrayTree.java
test4\BitTree.class
test4\BitTree.java
test4\BNode.class
test4\BNode.java
test4\Test.class
test4\Test.java
test4