html
<style>
  body {
    background: #f7f7f7;
  }
  .container {
    padding: 20px;
    font-family: Arial, sans-serif;
    font-weight: bold;
  }
  .title {
    text-align: center;
    font-size: 36px;
    font-weight: bold;
  }
  .description {
    text-align: center;
    font-size: 18px;
    color: #666;
  }
  .code {
    font-size: 18px;
  }
  .code pre {
    border: 4px solid #000;
    border-radius: 10px;
  }
</style>

<div class="container">
  <h1 class="title">Data Structure Traversal</h1>
  <p class="description">You've reached the depths of our data structure, where the trees are treacherous and the graphs are gnarly.</p>
  <h2 class="title">Binary Search Tree (BST)</h2>
  <p class="description">A tree with a bad haircut, the BST is the most common choice for beginners. It's like a big ol' mess of nodes, but hey, it's easy to implement.</p>
  <pre class="code">
    <code>
      // Binary Search Tree
      // 
      // Create a new node
      function Node(value) {
        this.value = value;
        this.left = null;
        this.right = null;
      }
      
      // Insert a value into the tree
      function insert(value) {
        if (!this.root) {
          this.root = new Node(value);
        } else {
          this.insertNode(this.root, value);
        }
      }
      
      // Traverse the tree in-order
      function inOrder(node) {
        if (node) {
          inOrder(node.left);
          process.stdout.write(node.value);
          inOrder(node.right);
        }
      }
      // </code>
  </pre>
  <a href="/subpages/binary-search-tree/bst-basics">Learn more about BST basics</a>
  <h2 class="title">Trie (prefix tree)</h2>
  <p class="description">A tree with a penchant for prefixes, the Trie is like a big ol' party with all your favorite words. Except, you know, it's a data structure.</p>
  <pre class="code">
    <code>
      // Trie
      // 
      // Create a new node
      function Node(word) {
        this.value = word;
        this.children = {};
      }
      
      // Insert a word into the trie
      function insert(word) {
        var currentNode = this.root;
        for (var i = 0; i < word.length; i++) {
          if (!currentNode.children[word[i]]) {
            currentNode.children[word[i]] = new Node(word);
          }
          currentNode = currentNode.children[word[i]];
        }
      }
      
      // Check if a word exists in the trie
      function exists(word) {
        var currentNode = this.root;
        for (var i = 0; i < word.length; i++) {
          if (!currentNode.children[word[i]]) {
            return false;
          }
          currentNode = currentNode.children[word[i]];
        }
        return true;
      }
      // </code>
  </pre>
  <a href="/subpages/trie/prefix-party">Learn more about Tries in action</a>
  <a href="/subpages/algorithm/algorithmic-traversal">But wait, what about graph traversal?</a>
</div>