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

What is the total number of edges from a particular node to its deepest descendant in a tree?

What is the total number of edges from a particular node to its deepest descendant in a tree?

Fill in the blank:
A binary tree in which every node has either 0 or 2 children is called __________.

Fill in the blank:
A binary tree in which every node has either 0 or 2 children is called __________.

The Level Order Traversal is a type of depth-first traversal. 

The Level Order Traversal is a type of depth-first traversal.

What is the output of the following code?
```python
tree = BinaryTree(12)
tree.root.left = Node(32)
tree.root.right = Node(37)
tree.root.left.left = Node(24)
tree.root.left.right = Node(5)
tree.root.right.left = Node(100)
tree.root.right.right = Node(75)

print(tree.print_tree("postorder"))
```

What is the output of the following code?
<pre><code class="language-python">tree = BinaryTree(12)
tree.root.left = Node(32)
tree.root.right = Node(37)
tree.root.left.left = Node(24)
tree.root.left.right = Node(5)
tree.root.right.left = Node(100)
tree.root.right.right = Node(75)

print(tree.print_tree(&quot;postorder&quot;))
</code></pre>

What is the time complexity of the depth-first traversals of a tree containing $n$ nodes?

What is the time complexity of the depth-first traversals of a tree containing <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math>n nodes?

It's quiz time! Test yourself by solving these questions about binary trees. 

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

Quiz