package Tree;
import java.util.Stack;
//定义树节点
class TreeNode{
int val;
TreeNode left;
TreeNode right;
TreeNode(int x){
val=x;
}
}
//我想要跟链表一样实现一个树的增删改查
//1.建立一个二叉树TreeBuild();
//2.增 add(TreeNode root);
//3.删delete(TreeNode root);
//4.改change(TreeNode root);
//5.查询所有的节点的值(遍历)search(TreeNode root)和查询指定节点的值searchOptional(int x)(假设树的每个节点的val都是不同的)
public class treeBasicOperations {
public static void main(String[] args) {
TreeNode treeNode = TreeBuild();//1.建立一个二叉树TreeBuild();
System.out.println("增加以前的树:");
search(treeNode);//5.查search(TreeNode root);
TreeNode searchresult = searchOptional(treeNode, 9);
add(searchresult);
System.out.println("增加之后的树:");
search
树的增删改查
最新推荐文章于 2022-11-16 15:38:35 发布