SiroDiaz / DataStructures

        $this->list = new CircularLinkedList();

    }

    public function testSize() {

        $this->assertEquals($this->list->size(), 0);

        $this->list->push(true);

        $this->list->push(2);

        $this->assertEquals($this->list->size(), 2);

    }

    public function testEmpty() {

        $this->assertTrue($this->list->empty());

        $this->list = new DoublyLinkedList();

    }

    public function testSize() {

        $this->assertEquals($this->list->size(), 0);

        $this->list->push(true);

        $this->list->push(2);

        $this->assertEquals($this->list->size(), 2);

    }

    public function testEmpty() {

        $this->assertTrue($this->list->empty());

        $this->list = new ArrayList();

    }

    public function testSize() {

        $this->assertEquals($this->list->size(), 0);

        $this->list->push(true);

        $this->list->push(2);

        $this->assertEquals($this->list->size(), 2);

    }

    public function testEmpty() {

        $this->assertTrue($this->list->empty());

        $this->tree = new TrieTree();

    }

    public function testAdd() {

        $this->tree->add('hello');

        $this->tree->add('bye');

        $this->assertEquals(8, $this->tree->size());

        $this->tree->add('hello');

        $this->assertEquals(8, $this->tree->size());

    }

    public function testWordCount() {

        $this->tree->add('hello');