List representation of tree

1. What is list representation of tree?
2. How do you represent a binary tree as a list?
3. What is array representation of a tree?
4. How can we represent tree as terms?

What is list representation of tree?

List Representation. In this representation, we use two types of nodes one for representing the node with data and another for representing only references. We start with a node with data from root node in the tree. Then it is linked to an internal node through a reference node and is linked to any other node directly.

How do you represent a binary tree as a list?

Linked List Representation of Binary Tree. We use a double linked list to represent a binary tree. In a double linked list, every node consists of three fields. First field for storing left child address, second for storing actual data and third for storing right child address.

What is array representation of a tree?

Given an array that represents a tree in such a way that array indexes are values in tree nodes and array values give the parent node of that particular index (or node). The value of the root node index would always be -1 as there is no parent for root.

How can we represent tree as terms?

Important Terms

Path − Path refers to the sequence of nodes along the edges of a tree. Root − The node at the top of the tree is called root. There is only one root per tree and one path from the root node to any node. Parent − Any node except the root node has one edge upward to a node called parent.