Trees DSAAL

Front

is a way of organizing data in a hierarchical (top-down) structure.

Back

Trees

Front

Trees help store and manage data efficiently and they are faster than lists for searching and organizing large amounts of data. True or False?

Back

True

Front

Trees consist of nodes (data points) connected by branches (links).

Back

True

Front

it’s a data type where each node can have two children at most both left and right

Back

Binary Tree

Front

Each node has 0 or 2 children, and never 1.

Back

Full Binary Tree

Front

It is where all internal nodes have 2 children and all the leaf nodes are at the same level.

Back

Perfect Binary Tree

Front

Adding a new node to the tree. In a BST, this involves comparing the value with the nodes and placing it in the appropriate position.

Back

Insertion

Front

Finding a node in the tree. In a BST, this operation involves comparing values and traversing left or right subtrees accordingly.

Back

Search

Front

Visiting all nodes in a specific order.

Back

Transversal

Front

Removing a node from the tree. This operation can be complex, especially in a BST, as it may involve re-arranging nodes to maintain tree properties.

Back

Deletion