liveBook · Manning

Binary tree

As explained in Applied Reinforcement Learning

A binary tree is a tree in which each node has at most two children.

A binary tree is a tree in which each node has at most two children. Binary trees are commonly used in search and sorting; a binary search tree branches on “less than” or “greater than.” section 7.1

Binary trees are one kind of branching structure, alongside decision trees, which map tests to outcomes, and game trees, which represent states and possible moves. section 7.1

Vehicle-route choices

A route tree branches from a depot into north and south routes, then into customer-delivery choices. This illustrates branching, though the Python RouteNode implementation allows any number of children. section 7.1

How Applied Reinforcement Learning covers it

How deep it goes
Defines the two-child limit and names search, sorting, and binary search trees without detailing binary-tree operations.
Examples
Illustrates branching with a vehicle-routing tree from a depot through north and south routes to customer choices.
What you can do after
Understand how a tree represents branching choices and recognize the binary tree’s two-child limit.
How it connects
Connects binary trees with search, sorting, binary search trees, decision trees, and game trees.

Also explained in

Compare how 7 books explain binary tree →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Applied Reinforcement Learning. The section links point to the parts of the book it draws on.