A tree is a node-based data structure. A node holds data and a reference to all of its children.
\nUnlike a linked list (which is also a node-based data structure), within a tree, each node can have links to multiple nodes.
\nHere is a visualization of a simple tree:
\nNodes that are at the same level and share a common parent are siblings of each other.
\nCreate a Node class. The constructor should accept an argument that gets assigned to the data property and initialize an empty array for storing children. The Node class should have two methods: add & remove.
Given some data, the add() method should create a new node and add it to the current node’s children array.
Given some data, the remove() method should look at each child of the current node and remove any node with data === data.
class Node {\n constructor(data) {\n this.data = data\n this.children = []\n }\n\n add(data) {\n this.children.push(new Node(data))\n }\n\n remove(data) {\n this.children = this.children.filter(node => node.data !== data)\n }\n}\n\nconst node = new Node(10)\n\nconsole.log(node)\n// { data: 10, children: [] }\n\nnode.add(20)\n\nnode.add(30)\n\nconsole.log(node)\n// {data: 10, children: [ { data: 20, children: [] }, { data: 30, children: [] } ]}\n\nnode.remove(30)\n\nconsole.log(node)\n// { data: 10, children: [ { data: 20, children: [] } ] }Create a Tree class. The constructor should initialize a root property to null.
class Tree {\n constructor() {\n this.root = null\n }\n}\nconst tree = new Tree()\n\ntree.root = node\n\nconsole.log(tree)\n// Tree { root: { data: 10, children: [ { data: 20, children: [] } ] } }You might be interested in the following blog posts:
\n