#ifndef TEST_BITREE_H
#define TEST_BITREE_H


#include <setjmp.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdio.h>
#include <google/cmockery.h>
#include <ds.h>

int tree_printer(void* node){
  ds_binode_t* n = (ds_binode_t*)node;
  printf("%d\n", (int)ds_bitree_data(n));
  return 1;
}

void test_bitree_generally(void **state) {
  ds_bitree_t* tree = ds_bitree_new(NULL);
  ds_bitree_ins_left(tree, NULL, (ds_data_t)1);

  ds_bitree_ins_left(tree, ds_bitree_root(tree), (ds_data_t)2);
  ds_bitree_ins_right(tree, ds_bitree_root(tree), (ds_data_t)3);

  assert_true(ds_bitree_size(tree) == 3);

  ds_bitree_preorder(ds_bitree_root(tree), tree_printer);
  ds_bitree_inorder(ds_bitree_root(tree), tree_printer);
  ds_bitree_postorder(ds_bitree_root(tree), tree_printer);

  ds_bitree_destroy(tree, 1);

  UNUSED(state);
}

#endif