Update readme.md

Co-Authored-By: Antim-IWP <203163676+Antim-IWP@users.noreply.github.com>
Co-Authored-By: Shiwangi Srivastava <174641070+IamShiwangi@users.noreply.github.com>

Author: 3 people

Solution/208. Implement Trie (Prefix Tree)/readme.md

@@ -1,7 +1,7 @@
 ---
 comments: true
 difficulty: Medium
-edit_url: https://github.com/doocs/leetcode/edit/main/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README_EN.md
+edit_url: Antim
 tags:
     - Design
     - Trie
@@ -13,7 +13,6 @@ tags:
 
 # [208. Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)
 
-[中文文档](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md)
 
 ## Description
 
@@ -219,329 +218,6 @@ public:
  */
 ```
 
-#### Go
-
-```go
-type Trie struct {
-	children [26]*Trie
-	isEnd    bool
-}
-
-func Constructor() Trie {
-	return Trie{}
-}
-
-func (this *Trie) Insert(word string) {
-	node := this
-	for _, c := range word {
-		idx := c - 'a'
-		if node.children[idx] == nil {
-			node.children[idx] = &Trie{}
-		}
-		node = node.children[idx]
-	}
-	node.isEnd = true
-}
-
-func (this *Trie) Search(word string) bool {
-	node := this.SearchPrefix(word)
-	return node != nil && node.isEnd
-}
-
-func (this *Trie) StartsWith(prefix string) bool {
-	node := this.SearchPrefix(prefix)
-	return node != nil
-}
-
-func (this *Trie) SearchPrefix(s string) *Trie {
-	node := this
-	for _, c := range s {
-		idx := c - 'a'
-		if node.children[idx] == nil {
-			return nil
-		}
-		node = node.children[idx]
-	}
-	return node
-}
-
-/**
- * Your Trie object will be instantiated and called as such:
- * obj := Constructor();
- * obj.Insert(word);
- * param_2 := obj.Search(word);
- * param_3 := obj.StartsWith(prefix);
- */
-```
-
-#### TypeScript
-
-```ts
-class TrieNode {
-    children;
-    isEnd;
-    constructor() {
-        this.children = new Array(26);
-        this.isEnd = false;
-    }
-}
-
-class Trie {
-    root;
-    constructor() {
-        this.root = new TrieNode();
-    }
-
-    insert(word: string): void {
-        let head = this.root;
-        for (let char of word) {
-            let index = char.charCodeAt(0) - 97;
-            if (!head.children[index]) {
-                head.children[index] = new TrieNode();
-            }
-            head = head.children[index];
-        }
-        head.isEnd = true;
-    }
-
-    search(word: string): boolean {
-        let head = this.searchPrefix(word);
-        return head != null && head.isEnd;
-    }
-
-    startsWith(prefix: string): boolean {
-        return this.searchPrefix(prefix) != null;
-    }
-
-    private searchPrefix(prefix: string) {
-        let head = this.root;
-        for (let char of prefix) {
-            let index = char.charCodeAt(0) - 97;
-            if (!head.children[index]) return null;
-            head = head.children[index];
-        }
-        return head;
-    }
-}
-```
-
-#### Rust
-
-```rust
-use std::{cell::RefCell, collections::HashMap, rc::Rc};
-
-struct TrieNode {
-    pub val: Option<char>,
-    pub flag: bool,
-    pub child: HashMap<char, Rc<RefCell<TrieNode>>>,
-}
-
-impl TrieNode {
-    fn new() -> Self {
-        Self {
-            val: None,
-            flag: false,
-            child: HashMap::new(),
-        }
-    }
-
-    fn new_with_val(val: char) -> Self {
-        Self {
-            val: Some(val),
-            flag: false,
-            child: HashMap::new(),
-        }
-    }
-}
-
-struct Trie {
-    root: Rc<RefCell<TrieNode>>,
-}
-
-/// Your Trie object will be instantiated and called as such:
-/// let obj = Trie::new();
-/// obj.insert(word);
-/// let ret_2: bool = obj.search(word);
-/// let ret_3: bool = obj.starts_with(prefix);
-impl Trie {
-    fn new() -> Self {
-        Self {
-            root: Rc::new(RefCell::new(TrieNode::new())),
-        }
-    }
-
-    fn insert(&self, word: String) {
-        let char_vec: Vec<char> = word.chars().collect();
-        // Get the clone of current root node
-        let mut root = Rc::clone(&self.root);
-        for c in &char_vec {
-            if !root.borrow().child.contains_key(c) {
-                // We need to manually create the entry
-                root.borrow_mut()
-                    .child
-                    .insert(*c, Rc::new(RefCell::new(TrieNode::new())));
-            }
-            // Get the child node
-            let root_clone = Rc::clone(root.borrow().child.get(c).unwrap());
-            root = root_clone;
-        }
-        {
-            root.borrow_mut().flag = true;
-        }
-    }
-
-    fn search(&self, word: String) -> bool {
-        let char_vec: Vec<char> = word.chars().collect();
-        // Get the clone of current root node
-        let mut root = Rc::clone(&self.root);
-        for c in &char_vec {
-            if !root.borrow().child.contains_key(c) {
-                return false;
-            }
-            // Get the child node
-            let root_clone = Rc::clone(root.borrow().child.get(c).unwrap());
-            root = root_clone;
-        }
-        let flag = root.borrow().flag;
-        flag
-    }
-
-    fn starts_with(&self, prefix: String) -> bool {
-        let char_vec: Vec<char> = prefix.chars().collect();
-        // Get the clone of current root node
-        let mut root = Rc::clone(&self.root);
-        for c in &char_vec {
-            if !root.borrow().child.contains_key(c) {
-                return false;
-            }
-            // Get the child node
-            let root_clone = Rc::clone(root.borrow().child.get(c).unwrap());
-            root = root_clone;
-        }
-        true
-    }
-}
-```
-
-#### JavaScript
-
-```js
-/**
- * Initialize your data structure here.
- */
-var Trie = function () {
-    this.children = {};
-};
-
-/**
- * Inserts a word into the trie.
- * @param {string} word
- * @return {void}
- */
-Trie.prototype.insert = function (word) {
-    let node = this.children;
-    for (let char of word) {
-        if (!node[char]) {
-            node[char] = {};
-        }
-        node = node[char];
-    }
-    node.isEnd = true;
-};
-
-/**
- * Returns if the word is in the trie.
- * @param {string} word
- * @return {boolean}
- */
-Trie.prototype.search = function (word) {
-    let node = this.searchPrefix(word);
-    return node != undefined && node.isEnd != undefined;
-};
-
-Trie.prototype.searchPrefix = function (prefix) {
-    let node = this.children;
-    for (let char of prefix) {
-        if (!node[char]) return false;
-        node = node[char];
-    }
-    return node;
-};
-
-/**
- * Returns if there is any word in the trie that starts with the given prefix.
- * @param {string} prefix
- * @return {boolean}
- */
-Trie.prototype.startsWith = function (prefix) {
-    return this.searchPrefix(prefix);
-};
-
-/**
- * Your Trie object will be instantiated and called as such:
- * var obj = new Trie()
- * obj.insert(word)
- * var param_2 = obj.search(word)
- * var param_3 = obj.startsWith(prefix)
- */
-```
-
-#### C#
-
-```cs
-public class Trie {
-    bool isEnd;
-    Trie[] children = new Trie[26];
-
-    public Trie() {
-
-    }
-
-    public void Insert(string word) {
-        Trie node = this;
-        foreach (var c in word)
-        {
-            var idx = c - 'a';
-            node.children[idx] ??= new Trie();
-            node = node.children[idx];
-        }
-        node.isEnd = true;
-    }
-
-    public bool Search(string word) {
-        Trie node = SearchPrefix(word);
-        return node != null && node.isEnd;
-    }
-
-    public bool StartsWith(string prefix) {
-        Trie node = SearchPrefix(prefix);
-        return node != null;
-    }
-
-    private Trie SearchPrefix(string s) {
-        Trie node = this;
-        foreach (var c in s)
-        {
-            var idx = c - 'a';
-            if (node.children[idx] == null)
-            {
-                return null;
-            }
-            node = node.children[idx];
-        }
-        return node;
-    }
-}
-
-/**
- * Your Trie object will be instantiated and called as such:
- * Trie obj = new Trie();
- * obj.Insert(word);
- * bool param_2 = obj.Search(word);
- * bool param_3 = obj.StartsWith(prefix);
- */
-```
-
 <!-- tabs:end -->
 
 <!-- solution:end -->