Provide an example in the readme

Readme.md

@@ -5,9 +5,10 @@
 [![Documentation](https://docs.rs/tree-ds/badge.svg)](https://docs.rs/tree-ds)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
 
-This library provides a tree data structure that can be used to represent 
-hierarchical data in Rust. The library 
+This library provides a tree data structure that can be used to represent
+hierarchical data in Rust. The library
 allows you to perform the following operations on a tree:
+
 - Enumerating all nodes in the tree
 - Enumerating a section of the tree
 - Finding a node in the tree
@@ -20,20 +21,61 @@ allows you to perform the following operations on a tree:
 - Finding the lowest common ancestor of two nodes
 
 ## Why use this library?
-There are many crates that make tree data structures available in Rust, but 
-this library is unique in that it provides a tree data structure that is 
-feature rich, easy to use and has a simple API. The library is also 
-well-documented and has a comprehensive test suite that ensures that it works 
-as expected. Most importantly, the library is designed to be fast and 
+
+There are many crates that make tree data structures available in Rust, but
+this library is unique in that it provides a tree data structure that is
+feature rich, easy to use and has a simple API. The library is also
+well-documented and has a comprehensive test suite that ensures that it works
+as expected. Most importantly, the library is designed to be fast and
 efficient, making it suitable for use in performance-critical applications.
 
 ## Usage
+
 Add the following to your `Cargo.toml` file:
+
 ```toml
 [dependencies]
 tree-ds = "0.1"
 ```
 
+A crude example of how to use the library is shown below:
+
+```rust
+use tree_ds::prelude::{Node, NodeRemovalStrategy, Tree};
+
+fn main() {
+	let mut tree = Tree::new();
+	let root = tree.add_node(Node::new("Risk", Some(5000)), None);
+	let fixed_income_node = tree.add_node(Node::new("Fixed Income", Some(2000)), Some(root));
+	let equity_node = tree.add_node(Node::new("Equity", Some(3000)), Some(root));
+	let debt_node = tree.add_node(Node::new("Debt", Some(1000)), Some(fixed_income_node));
+	let mutual_funds_node = tree.add_node(Node::new("Mutual Funds", Some(1000)), Some(equity_node));
+	let stocks_node = tree.add_node(Node::new("Stocks", Some(2000)), Some(equity_node));
+	tree.add_node(Node::new("Debt Mutual Funds", Some(500)), Some(debt_node));
+	tree.add_node(Node::new("Equity Mutual Funds", Some(500)), Some(mutual_funds_node));
+	tree.add_node(Node::new("Large Cap Stocks", Some(1000)), Some(stocks_node));
+	tree.add_node(Node::new("Mid Cap Stocks", Some(1000)), Some(stocks_node));
+	tree.add_node(Node::new("Small Cap Stocks", Some(1000)), Some(stocks_node));
+
+	println!("Original Tree");
+	println!("*********************");
+	println!("{}", tree);
+
+
+	tree.remove_node(stocks_node, NodeRemovalStrategy::RemoveNodeAndChildren);
+	println!("After removing Stocks Node");
+	println!("*******************");
+	println!("{}", tree);
+
+
+	let debt_mutual_funds_sub_tree = tree.get_subtree(equity_node, None);
+	println!("Debt Mutual Funds Sub Tree");
+	println!("*********************");
+	println!("{}", debt_mutual_funds_sub_tree);
+}
+
+```
 
 ## License
+
 This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.