AI engineering glossary · Data structures algorithms
What is binary tree?
Binary tree: A tree in which each node has at most two children, called left and right. It is the base for search trees, heaps and expression trees, and is commonly traversed in preorder, inorder or postorder.
Binary tree: an example
An expression like (2 + 3) * 4 becomes a tree with '*' at the root, a '+' node with children 2 and 3 on the left, and 4 on the right.
Related terms
More Data structures algorithms terms
- Bipartite graph
- Bloom filter
- Breadth-first search
- Bubble sort
- Call stack
- Circular buffer
- Coin change problem
- Collision
Where you learn it
Binary tree is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.