Java 二叉排序数

package binarySortTree;

/*
 * Java实现二叉排序树
 */

public class BinaryNode {

	private int value;
	private BinaryNode lChild;
	private BinaryNode rChild;

	public BinaryNode(int value, BinaryNode l, BinaryNode r) {
		this.value = value;
		this.lChild = l;
		this.rChild = r;
	}

	public BinaryNode getLChild() {
		return lChild;
	}

	public void setLChild(BinaryNode child) {
		lChild = child;
	}

	public BinaryNode getRChild() {
		return rChild;
	}

	public void setRChild(BinaryNode child) {
		rChild = child;
	}

	public int getValue() {
		return value;
	}

	public void setValue(int value) {
		this.value = value;
	}

	
	public static void iterate(BinaryNode root) {
		if (root.lChild != null) {
			iterate(root.getLChild());
		}
		System.out.print(root.getValue() + " ");
		if (root.rChild != null) {
			iterate(root.getRChild());
		}
	}


	public void addChild(int n) {
		if (n < value) {
			if (lChild != null) {
				lChild.addChild(n);
			} else {
				lChild = new BinaryNode(n, null, null);
			}
		} else {
			if (rChild != null) {
				rChild.addChild(n);
			} else {
				rChild = new BinaryNode(n, null, null);
			}
		}
	}

	public static void main(String[] args) {
		System.out.println();
		int[] arr = new int[] { 23, 54, 1, 65, 9, 3, 100 };
		BinaryNode root = new BinaryNode(arr[0], null, null);
		for (int i = 1; i < arr.length; i++) {
			root.addChild(arr[i]);
		}
		BinaryNode.iterate(root);
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
下面是一个Java排序树的代码示例: ```java public class BinarySortTree { private Node root; // 节点类 private class Node { int value; Node left; Node right; public Node(int value) { this.value = value; this.left = null; this.right = null; } } // 添加节点 public void addNode(Node node) { if (root == null) { root = node; } else { Node current = root; while (true) { if (node.value < current.value) { if (current.left == null) { current.left = node; break; } else { current = current.left; } } else { if (current.right == null) { current.right = node; break; } else { current = current.right; } } } } } // 中序遍历 public void middleSort() { middleSort(root); } private void middleSort(Node node) { if (node != null) { middleSort(node.left); System.out.print(node.value + " "); middleSort(node.right); } } // 查找节点 public Node search(int value) { Node current = root; while (current != null && current.value != value) { if (value < current.value) { current = current.left; } else { current = current.right; } } return current; } // 删除节点 public void delete(int value) { root = delete(root, value); } private Node delete(Node node, int value) { if (node == null) { return null; } if (value < node.value) { node.left = delete(node.left, value); } else if (value > node.value) { node.right = delete(node.right, value); } else { if (node.left == null) { return node.right; } else if (node.right == null) { return node.left; } Node minNode = findMin(node.right); node.value = minNode.value; node.right = delete(node.right, minNode.value); } return node; } private Node findMin(Node node) { while (node.left != null) { node = node.left; } return node; } } ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值