Coder Social home page Coder Social logo

holbertonschool-binary_trees's Introduction

Repository: C - Binary trees

Authors: @Ihansen225

Binary trees research and testing exercises.

Tools used:

Learning objectives:

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

Project files:

File Description
0-binary_tree_node.c Write a function that creates a binary tree node
1-binary_tree_insert_left.c Write a function that inserts a node as the left-child of another node
10-binary_tree_depth.c Write a function that measures the depth of a node in a binary tree
11-binary_tree_size.c Write a function that measures the size of a binary tree
12-binary_tree_leaves.c Write a function that counts the leaves in a binary tree
13-binary_tree_nodes.c Write a function that counts the nodes with at least 1 child in a binary tree
14-binary_tree_balance.c Write a function that measures the balance factor of a binary tree
15-binary_tree_is_full.c Write a function that checks if a binary tree is full
16-binary_tree_is_perfect.c Write a function that checks if a binary tree is perfect
17-binary_tree_sibling.c Write a function that finds the sibling of a node
18-binary_tree_uncle.c Write a function that finds the uncle of a node
2-binary_tree_insert_right.c Write a function that inserts a node as the right-child of another node
3-binary_tree_delete.c Write a function that deletes an entire binary tree
4-binary_tree_is_leaf.c Write a function that checks if a node is a leaf
5-binary_tree_is_root.c Write a function that checks if a given node is a root
6-binary_tree_preorder.c Write a function that goes through a binary tree using pre-order traversal
7-binary_tree_inorder.c Write a function that goes through a binary tree using in-order traversal
8-binary_tree_postorder.c Write a function that goes through a binary tree using post-order traversal
9-binary_tree_height.c Write a function that measures the height of a binary tree
binary_tree_print.c Auxiliary function to print a binary tree
binary_trees.h Header file

holbertonschool-binary_trees's People

Contributors

ihansen225 avatar ignaciocastro347 avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.