This language bar is your friend. Select your favorite languages!

Idiom #17 Create a Tree data structure

The structure must be recursive. A node may have zero or more children. A node has access to children nodes, but not to its parent.

class Tree {
    public $children = [];
    public $data;
    public function __construct($data, $children) {
        $this->data = $data;
        $this->children = $children;
typedef struct node_s
    int value;
    struct node_s *nextSibling;
    struct node_s *firstChild;
} node_t;
#include <vector>
template<typename T>
struct Node{
  T value;
  std::vector<Node<T>> children;
using System.Collections.Generic
class Node<T>
 T value;
 List<Node<T>> childNodes;
struct Node(T){
    Node[] children;
    T data;

alias TreeOfIntegers = Node!(int);
class Node<T> {
  final T value;
  final List<Node<T>> children;
  Node(this.value, this.children);
type Tree struct {
	Key keyType
	Deco valueType
	Children []*Tree
data Tree a = Node {
    value :: a,
    children :: [Tree a]
class Node {
  constructor (value, children = []) {
    this.value = value
    this.children = children
import java.util.List;
import java.util.ArrayList;
class Tree<K,V> {
  K key;
  V deco;
  List<Tree<K,V>> children = new ArrayList<>();
local function Tree(v, c)
	return {
		val = v,
		children = c
  TTree<_T> = class(TObject)
    Children: array of TObject;
    Data: _T;

  TStringTree = specialize TTree<String>;
  TTree = class
    Children: array of TTree;
    Data: TObject;
class Node(object):
    def __init__(self, value, *children):
        self.value = value
        self.children = list(children)
Node =
parent =[])
parent.children <<[])
struct Node<T> {
  value: T,
  children: Vec<Node<T>>,
(define (make-tree value children)
  (cons value children))

(define (tree-value t) (car t))
(define (tree-first-child t) (cadr t))
(define (tree-rest-children t) (cddr t))

Do you know the best way to do this in your language ?
New implementation...