Skip to main content
Code Golf

Questions tagged [binary-tree]

Ask Question

A high-level data structure, made of nodes, each with a maximum of 2 children (left and right). Nodes with no children are called leaves, and two nodes with the same parent are known as siblings.

33 questions
Newest Active Bountied Unanswered
8 votes
6 answers
1k views

Let N = [0,1,2,...n-1] be the initial segment of the natural numbers of length n, then all permutations of N can be sorted lexicographically, starting with the identity. The index into this sorted ...
Sophia Antipolis's user avatar
  • 1,742
8 votes
5 answers
851 views

Objective Given a positive reduced fraction, output its parent in the Stern-Brocot tree. The outputted fraction shall also be reduced. The Stern-Brocot tree The Stern-Brocot tree is an infinite-height ...
Dannyu NDos's user avatar
  • 7,381
11 votes
13 answers
1k views

For prime p, the factorization tree is a single vertex in just one way so that a(p) = 1. For composite n, the two subtrees at n are a split of n into two factors n = d * (n/d), without order, so that $...
Sophia Antipolis's user avatar
  • 1,742
11 votes
9 answers
1k views

Objective Given an unlabelled binary tree, decide whether it is contiguous in indices. Indices This challenge gives one-indexing on binary trees. The exact definition expresses all indices in binary ...
Dannyu NDos's user avatar
  • 7,381
11 votes
14 answers
852 views

For this challenge a "binary tree" is a rooted tree where each node has 0 children (leaf) or 2. The children of a node are unordered, meaning that while you might draw the tree with left ...
Wheat Wizard's user avatar
  • 103k
28 votes
12 answers
2k views

Consider a binary tree built the following way: The root node is \$1\$ For a given node \$n\$: If \$n\$ is odd, its only child is \$2n\$ If \$n\$ is even, one of its children is \$2n\$. If \$\frac {...
caird coinheringaahing's user avatar
  • 50.9k
12 votes
1 answer
312 views

Sandbox Inspired by a Codingame challenge I tried (and failed at) about a month ago. Given a binary tree of words, say: ...
Razetime's user avatar
  • 27.6k
16 votes
8 answers
363 views

Task Given a list of nodes representing a binary tree of positive integers serialized depth-first, return a list of nodes representing the same tree serialized breadth-first. To represent an absent ...
user's user avatar
  • 457
4 votes
3 answers
6k views

Maximillian is the chief commander of the Great Greek Army and he is leading his forces into a crucial war with Spain. If all the enemy soldiers stand in a straight line incrementally marked starting ...
Pluviophile's user avatar
  • 337
17 votes
2 answers
879 views

An unrooted binary tree is an unrooted tree (a graph that has single connected component and contains no cycles) where each vertex has exactly one or three neighbors. It is used in bioinformatics to ...
Bubbler's user avatar
  • 79.3k
20 votes
20 answers
3k views

Background Fibonacci trees \$T_n\$ are a sequence of rooted binary trees of height \$n-1\$. They are defined as follows: \$T_0\$ has no nodes. \$T_1\$ has a single node (the root). The root node of \$...
Bubbler's user avatar
  • 79.3k
8 votes
2 answers
425 views

Deserializing binary trees depth-first is pretty easy, but doing it breadth-first is (hopefully) harder. Your mission, should you choose to accept it, is to do the latter. The input will be a 1-D list ...
user's user avatar
  • 457
5 votes
8 answers
708 views

Any two separate nodes in a binary tree have a common ancestor, which is the root of a binary tree. The lowest common ancestor(LCA) is thus defined as the node that is furthest from the root and that ...
T. Salim's user avatar
  • 665
18 votes
11 answers
6k views

For each node in a balanced binary tree, the maximum difference in the heights of the left child subtree and the right child subtree are at most 1. The height of a binary tree is the distance from the ...
T. Salim's user avatar
  • 665
20 votes
20 answers
7k views

The height of a binary tree is the distance from the root node to the node child that is farthest from the root. Below is an example: ...
T. Salim's user avatar
  • 665

15 30 50 per page
1
2 3