https://github.com/amarquaye/binary_trees
0x1D. C - Binary trees - ALX Project
https://github.com/amarquaye/binary_trees
Last synced: 3 months ago
JSON representation
0x1D. C - Binary trees - ALX Project
- Host: GitHub
- URL: https://github.com/amarquaye/binary_trees
- Owner: amarquaye
- License: mit
- Created: 2023-08-03T13:02:59.000Z (almost 2 years ago)
- Default Branch: master
- Last Pushed: 2023-08-03T15:20:31.000Z (almost 2 years ago)
- Last Synced: 2025-01-11T04:44:22.392Z (5 months ago)
- Language: C
- Size: 15.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
- Authors: AUTHORS
Awesome Lists containing this project
README
# Binary_trees
0x1D. C - Binary trees - ALX Project
## Files
| Filename | Description |
| -------- | ----------- |
| `0-binary_tree_node.c` | Function that creates a binary tree node |
| `1-binary_tree_insert_left.c` | Function that inserts a node as the left-child of another node |
| `2-binary_tree_insert_right.c` | Function that inserts a node as the right-child of another node |
| `3-binary_tree_delete.c` | Function that deletes an entire binary tree |
| `4-binary_tree_is_leaf.c` | Funciton that checks if a node is a leaf |
| `5-binary_tree_is_root.c` | Function that checks if a given node is a root |
| `6-binary_tree_preorder.c` | Function that goes through a binary tree using pre-order traversal |
| `7-binary_tree_inorder.c` | Function that goes through a binary tree using in-order traversal |
| `8-binary_tree_postorder.c` | Function that goes through a binary tree using post-order traversal |
| `9-binary_tree_height.c` | Function that measures the height of a binary tree |
| `10-binary_tree_depth.c` | Function that measures the depth of a node in a binary tree |
| `11-binary_tree_size.c` | Funciton that measures the size of a binary tree |
| `12-binary_tree_leaves.c` | Function that counts the leaves in a binary tree |
| `13-binary_tree_nodes.c` | Function that counts the nodes with at least 1 child in a binary tree |
| `14-binary_tree_balance.c` | Function that measures the balance factor of a binary tree |
| `15-binary_tree_is_full.c` | Function that checks if a binary tree is full |
| `16-binary_tree_is_perfect.c` | Function that checks if a binary tree is perfect |
| `17-binary_tree_sibling.c` | Function that finds the sibling of a node |
| `18-binary_tree_uncle.c` | Function that finds the uncle of a node |
| `100-binary_trees_ancestor.c` | Funciton that finds the lowest common ancestor of two nodes |
| `101-binary_tree_levelorder.c` | Function that goes through a binary tree using level-order traversal |
| `102-binary_tree_is_complete.c` | Function that checks if a binary tree is complete |
| `103-binary_tree_rotate_left.c` | Function that performs a left-rotation on a binary tree |
| `104-binary_tree_rotate_right.c` | Function that performs a right-rotation on a binary tree |
| `110-binary_tree_is_bst.c` | Function that checks if a binary tree is a valid Binary Search Tree |
| `111-bst_insert.c` | Function that inserts a value in a Binary Search Tree |
| `112-array_to_bst.c` | Funciton that builds a Binary Search Tree from an array |
| `113-bst_search.c` | Function that searches for a value in a Binary Search Tree |
| `114-bst_remove.c` | Function that removes a node from a Binary Search Tree |
| `115-O` | File with the average time complexities of inserting a value, removing and searching a node on a Binary Search Tree |
| `120-binary_tree_is_avl.c` | Function that checks if a binary tree is a valid AVL Tree |
| `121-avl_insert.c` | Function that inserts a value in an AVL Tree |
| `122-array_to_avl.c` | Function that builds an AVL tree from an array |
| `123-avl_remove.c` | Function that removes a node from an AVL tree |
| `124-sorted_array_to_avl.c` | Funciton that builds an AVL tree from an array |
| `125-O` | File with the average time complexities of inserting a value, removing and searching a node on a AVL Tree |
| `130-binary_tree_is_heap.c` | Function that checks if a binary tree is a valid Max Binary Heap |
| `131-heap_insert.c` | Function that inserts a value in Max Binary Heap |
| `132-array_to_heap.c` | Function that builds a Max Binary Heap tree from an array |
| `135-O` | File with the average time complexities of inserting a value, removing and searching a node on a Binary Heap |