• Binary tree (note the first line: Not to be confused with B-tree.)
• Data Structure and Algorithms - Tree
• Tree Traversal
• Binary Search Tree
• Data structures: Binary Tree

• 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.

To match the examples in the tasks, you are given this function
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)

[Original code](Original code from http://stackoverflow.com/a/13755911/5184480)