Question

Need help with these two questions

String outputBreadthFirstSearch(): returns a string represenng a breadth first traversal. So, for example, for the tree shown in Figure 1, the method should output the string "bcaahttaetersse" 4. String outputDepthFirstSearch(): returns a string represenng a pre order depth first traversal. So, for example, for the tree shown in Figure 1, the method should output the string "batcathateersse

This is my code so far

public class Trie { final TrieNode root; public Trie() { this.root = new TrieNode(); } boolean add(String key) { TrieNode node = root; for (int i = 0; i < key.length(); i++) { int index = key.charAt(i); if (node.getChildren()[index] == null) { node.getChildren()[index] = new TrieNode(); } node = node.getChildren()[index]; } node.setIsComplete(true); return node.getIsComplete(); } boolean contains(String key) { TrieNode node = root; for(int i = 0; i < key.length(); i++){ int index = key.charAt(i)-'a'; if(node.getChildren()[index] == null) return false; node = node.getChildren()[index]; } return node.getIsComplete(); }

ROOT Dictionary cheers cheese chat cat bat 0 @

public class TrieNode { private char ch; private TrieNode[] children; private boolean isComplete; public TrieNode(){} public TrieNode(char ch) { this.ch = ch; this.children = new TrieNode[26]; this.isComplete = false; } public char getChar() { return ch; } public TrieNode[] getChildren() { return children; } public TrieNode findChildPosition(char c){ return children[c-'a']; } public boolean getIsComplete() { return isComplete; } void setIsComplete(boolean isComp) { this.isComplete = isComp; } }

Answer 1

The breadth-first search involves a search through a tree one level at a time. The code entered can be refined as follows: