Binary tree

As explained in Grokking Machine Learning

A tree data structure in which each node has at most two child branches.

A binary tree is made of nodes connected by branches, with at most two branches leaving each node. A decision tree uses this structure for yes-or-no questions: the root is the first question, decision nodes ask further questions, and leaves have no branches. section 9.0

Tree depth is the number of levels below the root, or the number of branches on the longest path from root to leaf. A decision stump has one decision node and two leaves, so its depth is one. section 9.0

Figure 9.1 A decision tree used to decide whether we want to wear a jacket or not on a given day. We make the decision by traversing the tree down and taking the branch corresponding to each correct answer.

Follow the branches to see how rain and temperature questions lead to a jacket decision. section 9.0

How Grokking Machine Learning covers it

How deep it goes

Defines roots, decision nodes, leaves, branches, and tree depth.

Examples

Uses rain and temperature questions to decide whether to wear a jacket.

What you can do after

Apply branch traversal to follow yes-or-no questions toward a decision.

How it connects

Connects binary trees with decision trees, decision nodes, leaves, and branches.

liveBookmanning.com

Read Grokking Machine Learning on liveBook Get the book at manning.com

Also explained in

• 

  liveBookmanning.com
  Grokking Algorithms, Second EditionA binary tree is a tree in which each node has at most two children.
• 

  liveBookmanning.com
  Learn C++ by ExampleA binary tree is a tree data structure in which each node has at most two child branches.
• 

  liveBookmanning.com
  Machine Learning for Tabular Data: XGBoost, Deep Learning, and AIA tree data structure in which each node has at most two child nodes.

Compare how 4 books explain binary tree →

Related concepts

• treekind of · A tree is a connected, acyclic structure of nodes, commonly organized hierarchically through parent-child relationships and optionally around a designated root.
• binary search treeincludes · A binary search tree is a binary tree whose nodes follow an ordering relation placing keys in designated left and right subtrees relative to each node.
• heapincludes · A binary heap is an almost complete binary tree in which each parent satisfies an ordering property relative to its children, enabling efficient access to a minimum or maximum element.
• k-d treeincludes · A k-d tree is a binary space-partitioning tree that organizes points in multidimensional space by recursively comparing coordinate dimensions.
• subtreeincludes · A subtree is a tree formed by a node and all its descendants, together with the links connecting them.
• Mapcontrasts with · A map is an associative data structure that stores key-value pairs and supports retrieving values by key.

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