algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' into binary_search_tree

Browse Source
This commit is contained in:
Yudong Jin
2023-01-10 13:30:38 +08:00
committed by GitHub
parent 96d54bff3a a86bdeb7cd
commit daa28be3e4
215 changed files with 5618 additions and 1642 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/java/chapter_tree/avl_tree.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: avl_tree.java
* Created Time: 2022-12-10
* Author: Krahets (krahets@163.com)
@ -138,7 +138,7 @@ class AVLTree {
node = child;
} else {
// 子结点数量 = 2 ，则将中序遍历的下个结点删除，并用该结点替换当前结点
TreeNode temp = minNode(node.right);
TreeNode temp = getInOrderNext(node.right);
node.right = removeHelper(node.right, temp.val);
node.val = temp.val;
}
@ -150,8 +150,8 @@ class AVLTree {
return node;
}
/* 获取最小结点 */
private TreeNode minNode(TreeNode node) {
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
private TreeNode getInOrderNext(TreeNode node) {
if (node == null) return node;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (node.left != null) {

8
codes/java/chapter_tree/binary_search_tree.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_search_tree.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -101,7 +101,7 @@ class BinarySearchTree {
// 子结点数量 = 2
else {
// 获取中序遍历中 cur 的下一个结点
TreeNode nex = min(cur.right);
TreeNode nex = getInOrderNext(cur.right);
int tmp = nex.val;
// 递归删除结点 nex
remove(nex.val);
@ -111,8 +111,8 @@ class BinarySearchTree {
return cur;
}
/* 获取最小结点 */
public TreeNode min(TreeNode root) {
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
public TreeNode getInOrderNext(TreeNode root) {
if (root == null) return root;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (root.left != null) {

2
codes/java/chapter_tree/binary_tree.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_tree.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)

5
codes/java/chapter_tree/binary_tree_bfs.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_tree_bfs.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -30,8 +30,7 @@ public class binary_tree_bfs {
public static void main(String[] args) {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
TreeNode root = TreeNode.arrToTree(new Integer[] {
1, 2, 3, 4, 5, 6, 7, null, null, null, null, null, null, null, null });
TreeNode root = TreeNode.arrToTree(new Integer[] { 1, 2, 3, 4, 5, 6, 7 });
System.out.println("\n初始化二叉树\n");
PrintUtil.printTree(root);

5
codes/java/chapter_tree/binary_tree_dfs.java
View File

@ -1,4 +1,4 @@
/*
/**
* File: binary_tree_dfs.java
* Created Time: 2022-11-25
* Author: Krahets (krahets@163.com)
@ -43,8 +43,7 @@ public class binary_tree_dfs {
public static void main(String[] args) {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
TreeNode root = TreeNode.arrToTree(new Integer[] {
1, 2, 3, 4, 5, 6, 7, null, null, null, null, null, null, null, null});
TreeNode root = TreeNode.arrToTree(new Integer[] { 1, 2, 3, 4, 5, 6, 7 });
System.out.println("\n初始化二叉树\n");
PrintUtil.printTree(root);