|
42 | 42 | "is_red_black_tree": "Check if a binary tree is a valid Red-Black tree" |
43 | 43 | }, |
44 | 44 | "Insertions": { |
45 | | - "insert_node_in_empty_tree": "Inserting a new node in an empty tree", |
46 | | - "insert_node_in_binary_tree": "Inserting a node with a given value in a binary tree", |
47 | | - "insert_node_in_bst_recursion": "Inserting a node with a given value in a binary search tree using recursion", |
48 | | - "insert_node_in_bst_iteration": "Inserting a node with a given value in a binary search tree using iteration", |
| 45 | + "insert_node_in_tree": "Inserting a new node in a binary tree", |
| 46 | + "insert_node_in_bst": "Inserting a node with a given value in a binary search tree", |
49 | 47 | "insert_node_in_avl_tree": "Inserting a node with a given value in an AVL tree", |
50 | 48 | "insert_node_in_red_black_tree_black_parent": "Inserting a node in a Red-Black tree when the parent is black", |
51 | 49 | "insert_node_in_red_black_tree_red_parent_and_uncle": "Inserting a node in a Red-Black tree when the parent and uncle are red", |
52 | 50 | "insert_node_in_red_black_tree_red_parent_and_black_uncle": "Inserting a node in a Red-Black tree when the parent is red and uncle is black", |
53 | | - "insert_node_in_red_black_tree_top_down_insertion": "Top-down insertion in a Red-Black tree", |
54 | 51 | "insert_node_in_tst": "Inserting a word in a ternary search tree (TST)", |
55 | 52 | "insert_node_in_btree": "Inserting an element in a B-tree", |
56 | 53 | "insert_node_in_parent_b+tree": "Inserting an element in a parent node of a B+ tree", |
57 | | - "insert_node_in_leaf_b+tree": "Inserting an element in a leaf node of a B+ tree", |
58 | | - "insert_node_in_b+tree": "Inserting an element in a B+ tree" |
| 54 | + "insert_node_in_leaf_b+tree": "Inserting an element in a leaf node of a B+ tree" |
59 | 55 | }, |
60 | 56 | "Deletions":{ |
61 | 57 | "delete_node_binary_tree": "Deleting a node with a given value from a binary tree", |
|
0 commit comments