Data Structures: Trees

Question 1

What are tree stuctures?

Answer 1

A Binary Search Tree (BST) is a tree in which all the nodes follow the below-mentioned properties − The left sub-tree of a node has a key less than or equal to its parent node’s key. The right sub-tree of a node has a key greater than to its parent node’s key.

Question 2

Tree structure operations

Answer 2

addChild
removeChild
traverse

Question 3

Common uses for a tree structure

Answer 3

for storing hierarchical data with a directed flow.

Question 4

Three kinds of traversals

Answer 4

preorder: the root node of the tree is processed first, then the left subtree is
traversed, then the right subtree.

postorder: the left subtree is traversed, then the right subtree, and then the root node is processed.

inorder: the left
subtree is traversed first, then the root node is processed, then the right subtree is traversed.