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
Filter by
Sorted by
Tagged with
8 votes
5 answers
847 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,371
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 ...
Dannyu NDos's user avatar
  • 7,371
10 votes
8 answers
2k views

Given an integer n, enumerate all possible full binary trees with n internal nodes. (Full binary trees have exactly 2 children on every internal node). The tree structure should be output as a pre-...
138 Aspen's user avatar
  • 7,277
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 ...
97.100.97.109's user avatar
  • 7,465
11 votes
14 answers
851 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 ...
Alice F's user avatar
  • 445
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 \$...
n1k9's user avatar
  • 81
16 votes
8 answers
362 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 ...
digEmAll's user avatar
  • 5,069
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: ...
Wezl's user avatar
  • 1,496
25 votes
16 answers
2k views

Background A binary tree is a rooted tree whose every node has at most two children. A labelled binary tree is a binary tree whose every node is labelled with a positive integer; moreover, all ...
Dominic van Essen's user avatar
  • 37.2k
15 votes
5 answers
760 views

Task Given the pre-order and post-order traversals of a full binary tree, return its in-order traversal. The traversals will be represented as two lists, both containing n distinct positive integers,...
Adám's user avatar
  • 31.8k
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 ...
Grimmy's user avatar
  • 15.8k
15 votes
12 answers
3k views

Given a unique, sorted list of integers, create a balanced binary-search tree represented as an array without using recursion. For example: ...
Community's user avatar
  • 1
20 votes
9 answers
2k views

Binary trees A binary tree is a tree with nodes of three types: terminal nodes, which have no children unary nodes, which have one child each binary nodes, which have two children each We can ...
Neil's user avatar
  • 184k
24 votes
7 answers
1k views

Inspired by A014486. Challenge Given an integer input in base 10, construct a representation for the binary forest corresponding to the input. Representations include, but are not limited to, nested ...
Community's user avatar
  • 1
7 votes
1 answer
478 views

Brief Print an ASCII representation of a binary search tree. You should write your own minimum implementation logic of a BST (node, left, right, insert) (50,30,70,20,80,40,75,90) gives: ...
Denham Coote's user avatar
  • 1,437
9 votes
6 answers
1k views

Write a program that takes a binary tree as input, and outputs the deepest node and its depth. If there is a tie, print all involved nodes as well as their depths. Each node is represented as: ...
Community's user avatar
  • 1
10 votes
5 answers
982 views

Write a filter that converts text from standard input to a representation of its Huffman tree on standard output. In as few characters as possible. you're free to consider newlines or not output ...
Community's user avatar
  • 1