C++ (Cpp) level_traverse Examples

Example #1

File: Binary_Tree_Breadth_Level_Traversal.c Project: prrateekk/Git

int main(){
    struct node* root=NULL;
    head=NULL;
    rear=NULL;
    int n,i,x;
    printf("Enter the number of elements in the tree:");
    scanf("%d",&n);
    printf("Enter the elements:\n");
    for (i=0;i<n;i++){
        scanf("%d",&x);
        root=insert(root,x);
    }
    level_traverse(root);
    return 0;
}

Example #2

File: binary_tree_algorithms.c Project: rainyear/C

int main(int argc, char const *argv[]) {
  Tree *root;// = (Tree*)malloc(sizeof(Tree));
  // TreeElement list[15] = {18, 22, 7, -1, -1, 4, 5, -1, -1, -1, 10, 2, -1, -1, 21};
  TreeElement list[21] = {'-', '+', 'a', ' ', ' ', '*', 'b', ' ', ' ', '-', 'c', ' ', ' ', 'd', ' ', ' ', '/', 'e', ' ', ' ','f'};
  create_binary_tree(&root, list, 21);

  printf("Pre Order:\t");
  pre_order_traverse_recursive(root);
  newline();
  printf("In Order:\t");
  in_order_traverse_recursive(root);
  newline();
  printf("Post Order:\t");
  post_order_traverse_recursive(root);
  newline();
  printf("By Level:\t");
  level_traverse(root);
  return 0;
}