var BinaryTree = require('binarytree');
var binaryTree = new BinaryTree('F');
let bNode = binaryTree.appendChildNode('B', 'left', alphabetTree.root);
let aNode = binaryTree.appendChildNode('A', 'left', bNode);
let dNode = binaryTree.appendChildNode('D', 'right', bNode);
let cNode = binaryTree.appendChildNode('C', 'left', dNode);
let eNode = binaryTree.appendChildNode('E', 'right', dNode);
let gNode = binaryTree.appendChildNode('G', 'right', binaryTree.root);
let iNode = binaryTree.appendChildNode('I', 'right', gNode);
let hNode = binaryTree.appendChildNode('H', 'left', iNode);
let breathTransversal = binaryTree.BFS();
let preTransversal = binaryTree.DFS('preorder');
let inorderTransversal = binaryTree.DFS('inorder');
let postorderTransversal = binaryTree.DFS('postorder');