Data Structure - Tree

Question 1

What is a tree?

Answer 1

It’s an abstract data type that represents a hierarchical tree structure with a set of connected nodes, where each node in the tree can be connected to many children, but must be connected to exactly one parent, except for the root node, which has no parent.

Question 2

What is a binary tree?

Answer 2

It’s a tree with the constrain number of children for each parent to exactly two.

Question 3

What are some applications of trees?

Answer 3

File systems, class hierarchy (inheritance), Abstract Syntax Trees and others.

Question 4

What is tree transversal?

Answer 4

It’s the process of visiting and outputting the value of each node of a tree in a particular order.

Question 5

How in-order transversal works?

Answer 5

It traverses from the left subtree, to the root then, to the right subtree

https://kalkicode.com/pixels/binary-tree/inorder-traversal-of-binary-tree.png

Question 6

How pre-order transversal works?

Answer 6

It traverses from the root, to the left subtree then, to the right subtree.

https://kalkicode.com/pixels/binary-tree/preorder-tree-traversal.png

Question 7

How post-order transversal works?

Answer 7

It traverses from the left subtree, to the right subtree, then to the root.

https://kalkicode.com/pixels/binary-tree/postorder-tree-traversal.png

Question 8

Tree transversal exercise

Answer 8

https://media.geeksforgeeks.org/wp-content/cdn-uploads/Preorder-from-Inorder-and-Postorder-traversals.jpg