二叉树的三叉链表实现c语言,数据结构：二叉树的三叉链表存储--Java实现
public class ThreeLinkTree {
// 內部節點類
public static class TreeNode {
Object data;
TreeNode left;
TreeNode right;
TreeNode parent;
public TreeNode(Object data) {
this.data = data;
}
public TreeNode(Object data, TreeNode left, TreeNode right,
TreeNode parent) {
this.data = data;
this.left = left;
this.right = right;
this.parent = parent;
}
public TreeNode() {
}
}
// root
private TreeNode root;
// 默認方式創建二叉樹
public ThreeLinkTree() {
root = new TreeNode();
}
// 指定元素創建二叉樹
public ThreeLinkTree(E data) {
root = new TreeNode(data);
}
// 判定二叉樹是否為空
public boolean empty() {
return root == null;
}
// 獲取根節點
public TreeNode getRoot() {
if (empty()) {
throw new RuntimeException("無根節點");
} else {
return root;
}
}
// 獲取指定節點的左節點
public E leftChild(TreeNode node) {
if (node == null) {
throw new RuntimeException("該節點為空");
}
return node.left == null ? null : (E) node.left.data;
}
// 獲取指定節點的右節點
public E rightChild(TreeNode node) {
if (node == null) {
throw new RuntimeException("該節點為空");
}
return node.right == null ? null : (E) node.right.data;
}
// 獲取指定節點的父節點
public E parent(TreeNode node) {
if (node == null) {
throw new RuntimeException("該節點為空");
}
return (E) node.parent.data;
}
// 向二叉樹中添加節點
public TreeNode addNote(TreeNode parent, E data, boolean isleft) {
if (parent == null) {
throw new RuntimeException("無法添加此節點，此節點為空");
}
if (isleft && parent.left != null) {
throw new RuntimeException("此節點以有左節點，無法添加");
}
if (!isleft && parent.right != null) {
throw new RuntimeException("此節點以有右節點，無法添加");
}
TreeNode newNode = new TreeNode(data);
if (isleft) {
parent.left = newNode;
} else {
parent.right = newNode;
}
newNode.parent = parent;
return newNode;
}
// 獲取二叉樹的深度
public int deepin() {
return deepin(root);
}
// 獲取指定節點的子樹的深度
public int deepin(TreeNode node) {
if (node == null) {
return 0;
}
if (node.left == null && node.right == null) {
return 1;
} else {
int leftdeep = deepin(node.left);
int rightdeep = deepin(node.right);
int max = (leftdeep > rightdeep ? leftdeep : rightdeep);
return max + 1;
}
}
}
總結
以上是生活随笔為你收集整理的二叉树的三叉链表实现c语言,数据结构：二叉树的三叉链表存储--Java实现的全部內容，希望文章能夠幫你解決所遇到的問題。
- 上一篇： c语言编程抢30,抢三十-程序?
- 下一篇： android okio使用方法,And