Learn how to implement popular data structures and algorithms in our next Python project with hands-on examples.

Python for Programmers

Data structures and algorithms are among the most fundamental concepts of computer science. This module is a detailed review of some of the most common data structures and algorithms, such as stack, linked lists, doubly linked lists, binary trees, binary search trees, and so on. With implementation details, thorough explanations, and hands-on coding exercises, we’ll gain the confidence to solve any problem related to our project.

Data Structures and Algorithms in Python

In this coding exercise, you are required to use the stack data structure to convert integer values to their binary equivalent.

## Division by 2 Method
The slides below show how to use the _**division by 2**_ method to compute the binary equivalent for an integer. 


In this coding exercise, you are required to use the stack data structure to convert integer values to their binary equivalent.

# Division by 2 Method
The slides below show how to use the _**division by 2**_ method to compute the binary equivalent for an integer. 


Challenge yourself to solve the problem in this lesson!

Built-in Data Structures

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Conclusion

Exercise: Convert Decimal Integer to Binary

Division by 2