--description--

In this project, you are going to create a Binary Search Tree (BST). A BST is a data structure in which each node has at most two children, with the left child containing values less than the parent node and the right child containing values greater than the parent node, allowing for efficient searching and sorting operations.

This is what a Binary Search Tree looks like:

Begin by defining an empty TreeNode class. The TreeNode class represents a node in a binary search tree. Use the pass keyword to fill the class body and avoid an error.

--hints--

You should use the class keyword to declare an empty class named TreeNode.

({
  test: () => {
    assert(runPython(`
      import inspect
      inspect.isclass(TreeNode)
    `));
  }
})

--seed--

--seed-contents--

--fcc-editable-region--

--fcc-editable-region--