Ncert-learn

Fixed
- **Bug Fixes**: Fixed File Not Found In Miner.

Fixed
- **Bug Fixes**: Fixed Automatic Starting Of Miner ON Importing Module.

Added
- **Monero Mining Support**: New functions for Monero mining, including pool setup, miner monitoring, and profitability calculations. The mining features are optimized for both CPU and GPU mining.
- `get_mining_pool_info_monero`: Fetches information about Monero mining pools.
- `setup_miner_xmrg`: Sets up the XMR-G miner for Monero.
- `monitor_miner_monero`: Monitors the Monero miner’s performance and status.
- `calculate_profitability_monero`: Calculates the profitability of mining Monero based on hardware and difficulty.
- `mine_monero`: Starts the Monero mining process with default settings.
- `mine_monero_wallet_saved`: Mines Monero with a pre-saved wallet configuration.
- `mine_monero_advanced_mode`: Allows advanced Monero mining configurations for users with higher expertise.

Fixed
- **Bug Fixes**: Fixed several issues related to file handling, string operations, and database interactions.
- **Error Handling**: Improved error handling for file operations, network requests, and system commands.

Added
**Variety Types Of Trees**: Added Functions To Handle Various Types Of Tree Handling In Classes.
- **Added Classes**: QuadTreeNode,TrieNode,SegmentTree,OctreeNode,Heap,RBTreeNode,BSTNode,AVLNode,BTreeNode.
- **Some Functions OutSide Class**: `bst_insert`,`bst_search`,`bst_inorder`,`avl_insert`,`avl_get_height`,`avl_get_balance`,`avl_left_rotate`,`avl_right_rotate`,`rb_insert`,`rb_insert_fixup`,`rb_left_rotate`,`rb_right_rotate`,`btree_insert`,`btree_insert_non_full`,`btree_split`,`trie_insert`.

Added
- **Set Operations:**
- `set_create`: Creates a new set.
- `set_add`: Adds an element to the set.
- `set_remove`: Removes an element from the set.
- `set_discard`: Removes an element from the set if it exists, without throwing an error.
- `set_is_member`: Checks if an element is present in the set.
- `set_size`: Returns the size of the set.
- `set_clear`: Clears all elements in the set.

- **Queue Operations:**
- `queue_create`: Creates a new queue.
- `queue_enqueue`: Adds an element to the end of the queue.
- `queue_dequeue`: Removes and returns the element from the front of the queue.
- `queue_peek`: Returns the element at the front of the queue without removing it.
- `queue_is_empty`: Checks if the queue is empty.
- `queue_size`: Returns the size of the queue.
- `queue_clear`: Clears all elements in the queue.

- **Dictionary Operations:**
- `dict_create`: Creates a new dictionary.
- `dict_add`: Adds a key-value pair to the dictionary.
- `dict_get`: Retrieves the value for a given key.
- `dict_remove`: Removes a key-value pair from the dictionary.
- `dict_key_exists`: Checks if a key exists in the dictionary.
- `dict_get_keys`: Returns all keys in the dictionary.
- `dict_get_values`: Returns all values in the dictionary.
- `dict_size`: Returns the size of the dictionary.
- `dict_clear`: Clears all key-value pairs in the dictionary.

- **Tree Operations:**
- `tree_insert`: Inserts a node into the tree.
- `tree_inorder`: Performs an inorder traversal of the tree.
- `tree_search`: Searches for a node in the tree.
- `tree_minimum`: Finds the minimum value in the tree.
- `tree_maximum`: Finds the maximum value in the tree.
- `tree_size`: Returns the number of nodes in the tree.
- `tree_height`: Returns the height of the tree.
- `tree_level_order`: Performs a level order traversal of the tree.
- `tree_postorder`: Performs a postorder traversal of the tree.
- `tree_preorder`: Performs a preorder traversal of the tree.
- `tree_breadth_first`: Performs a breadth-first search in the tree.
- `tree_depth_first`: Performs a depth-first search in the tree.
- `tree_delete`: Deletes a node from the tree.

Changed
- Improved error handling for all new functions to ensure graceful failure and informative messages for invalid inputs or operations.

Fixed
- Optimized existing code for better performance in data structure operations.