class Main {
public static void main(String[] args) {
TreeNode root = buildTree();
}
private static TreeNode buildTree() {
/**
* A
* / \
* B C
* / \ /\
* D E F G
*/
TreeNode D = new TreeNode("D");
TreeNode E = new TreeNode("E");
TreeNode B = new TreeNode("B");
B.left = D;
B.right = E;
TreeNode F = new TreeNode("F");
TreeNode G = new TreeNode("G");
TreeNode C = new TreeNode("C");
C.left = F;
C.right = G;
TreeNode A = new TreeNode("A");
A.left = B;
A.right = C;
return A;
}
static class TreeNode {
String value;
TreeNode left;
TreeNode right;
public TreeNode(String value) {
this.value = value;
}
}
}
算法树构造
最新推荐文章于 2022-09-13 16:25:34 发布