二叉树删除节点-简化版

class BinaryTree {
	private HeroNode root;
	
	public void setRoot(HeroNode root) {
		this.root = root;
	}
	
	//删除节点
	public void delNode(int no) {
		if (root != null) {
			if (root.getNo() == no) {
				root = null;
			} else {
				root.delNo(no);
			}
		}
	}
}

class HeroNode {
	private int no;
	private String name;
	private HeroNode left;
	private HeroNode right;
	
	public HeroNode(int no, String name) {
		this.no = no;
		this.name = name;
	}
	
	public int getNo() {
		return no;
	}
	
	public void setNo(int no) {
		this.no = no;
	}
	
	public String getName() {
		return name;
	}
	
	public void setName(String name) {
		this.name = name;
	}
	
	public HeroNode getLeft() {
		return left;
	}
	
	public void setLeft(HeroNode left) {
		this.left = left;
	}
	
	public HeroNode getRight() {
		return right;
	}
	
	public void setRight(HeroNode right) {
		this.right = right;
	}
	
	@Override
	public String toString() {
		return "HearNode{" +
				"no=" + no +
				", name='" + name + '\'' +
				'}';
	}
	
	/*
	1.如果是叶子节点则删除该节点
	2.如果是非叶子节点则删除子树
	 */
	public void delNo(int no) {
		if (this.left != null && this.left.no == no) {
			this.left = null;
			return;
		}
		
		if (this.right != null && this.right.no == no) {
			this.right = null;
			return;
		}
		
		if (this.left != null) {
			this.left.delNo(no);
		}
		
		if (this.right != null) {
			this.right.delNo(no);
		}
	}
}