Skip to content

andres-condezo/binary_trees

Repository files navigation

0x1D. C - Binary trees

This project it's about:

  • 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

Tasks:

  • 0-binary_tree_node.c
  • 1-binary_tree_insert_left.c
  • 2-binary_tree_insert_right.c
  • 3-binary_tree_delete.c
  • 4-binary_tree_is_leaf.c
  • 5-binary_tree_is_root.c
  • 6-binary_tree_preorder.c
  • 7-binary_tree_inorder.c
  • 8-binary_tree_postorder.c
  • 9-binary_tree_height.c
  • 10-binary_tree_depth.c

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages