1. What is tree?
2. What are the elements of Tree?
3. What are the different representation of tree?
4. Identify and Discuss the different terminologies of Tree?
5. What is the difference and similarities of full binary tree and complete binary tree
6. What is AVL and Non AVL Tree?
1. A tree is a data structure that consists of nodes connected by edges. It is a hierarchical structure that can be used to represent data in a logical way.
2. The elements of a tree are nodes, edges, and root. A node is a data element that contains information, an edge is a connection between two nodes, and the root is the topmost node in the tree.
3. The different representations of a tree are pre-order, in-order, post-order, level-order, and breadth-first search.
4. The different terminologies of a tree are parent, child, siblings, ancestor, descendant, level, depth, and height. The parent is the node that is connected to the current node, the child is the node that is connected to the parent node, siblings are nodes that have the same parent, an ancestor is a node that is higher in the tree, a descendant is a node that is lower in the tree, level is the number of edges between the root and the node, depth is the number of edges from the root to the deepest node, and height is the number of edges from the deepest node to the root.
5. A full binary tree is a tree in which each node has either two or zero children, while a complete binary tree is a tree in which all levels are completely filled except for the last level, which is filled from left to right.
6. AVL tree is a self-balancing binary search tree, while a non-AVL tree is a binary search tree that is not self-balancing.