nueluzoma/binary_trees

00x1D. C - Binary trees

C

Group project

Algorithm

Data structure

General

• What is a binary tree
• What is the difference between a binary tree and a Binary Search Tree
• What is the possible gain in terms of time complexity compared to linked lists
• What are the depth, the height, the size of a binary tree
• What are the different traversal methods to go through a binary tree
• What is a complete, a full, a perfect, a balanced binary tree

GitHub

• There should be one project repository per group. If you clone/fork/whatever a project repository with the same name before the second deadline, you risk a 0% score.

Data structures

• Please use the following data structures and types for binary trees. Don’t forget to include them in your header file.

Basic Binary Tree

/**

• struct binary_tree_s - Binary tree node
• @n: Integer stored in the node
• @parent: Pointer to the parent node
• @left: Pointer to the left child node
• @right: Pointer to the right child node */

typedef struct binary_tree_s

{

int n;
struct binary_tree_s *parent;
struct binary_tree_s *left;
struct binary_tree_s *right;

}binary_tree_t;

Binary Search Tree

typedef struct binary_tree_s bst_t;

AVL Tree

typedef struct binary_tree_s avl_t;

Max Binary Heap

typedef struct binary_tree_s heap_t;

Note: For tasks 0 to 23 (included), you have to deal with simple binary trees. They are not BSTs, thus they don’t follow any kind of rule.

Print function

• To match the examples in the tasks, you are given this function below
• This function is used only for visualization purposes. You don’t have to push it to your repo. It may not be used during the correction

Functions to print binary trees in a pretty way

                       .----------------------(006)-------.
                  .--(001)-------.                   .--(008)--.
             .--(-02)       .--(003)-------.       (007)     (009)
   .-------(-06)          (002)       .--(005)

.--(-08)--. (004) (-09) (-07)