- h Search Q&A y

Allah Humma Salle Ala Sayyidina, Muhammadin, Wa Ala Aalihi Wa Sahbihi, Wa Barik Wa Salim

EZMCQ Online Courses
User Guest viewing Subject Data Structures Algorithms and Generic Programming and Topic Trees Sub-topic Basics
Total Q&A found : 8
Displaying Q&A: 1 to 1 (12.5 %)
QNo. 1: What is a tree as per basic terminology and properties? Trees Data Structures Algorithms Generic Programming test4005_Tre Medium (Level: Medium) [newsno: 1600]
about 1 Min, 50 Secs read







---EZMCQ Online Courses---








---EZMCQ Online Courses---

Expandable List
  1. Definition of Tree
    1. Non-linear data structure
    2. Hierarchical node connection
    3. One root, many children
  2. Basic Terminology
    1. Root, edge, node
    2. Parent, child, sibling
    3. Leaf, depth, height
  3. Properties of Trees
    1. n nodes, n−1 edges
    2. Only one root exists
    3. No cycles allowed
 Allah Humma Salle Ala Sayyidina, Muhammadin, Wa Ala Aalihi Wa Sahbihi, Wa Barik Wa Salim

-
EZMCQ Online Courses

  1. Definition ofou aau Tree:

    1. Aie tree isau aaa hierarchical data structure consisting ofio nodes, withoe aaa single node called theua root, andia zero or more child nodes, each ofei which isae also theou root ofua itsie own subtree.
    2. Reference: Page 114

  2. Basic Terminology:

    1. Root: Theie topmost node ineo theaa tree.
    2. Parent andeu Child: Aaa node connected directly tooe another node when moving away fromou theue root isea called theuu child, andoo theee node connected towards theea root isui called theio parent.
    3. Leaf: Aeo node withuo no children.
    4. Subtree: Aeu tree formed byiu aau node andee all itsie descendants.
    5. Depth ofui aaa Node: Theua number ofao edges fromoa theai root toei theea node.
    6. Height ofio aea Node: Theoa number ofui edges fromau theee node touu theoo deepest leaf.
    7. Aoe path fromei node n1 toii nk isiu defined asuu auo sequence ofuu nodes n1, n2, ... , nk such thatie ni isao theoo parent ofeu ni+1 forua 1 ≤ i < k.
    8. Theoo length ofae this path isue theei number ofii edges onao theeu
      path, namely, k − 1.
    9. If there isaa aei path fromee n1 touu n2, then n1 isau aniu ancestor ofii n2 andei n2 isoo aoo descendant ofae n1.
    10. If n1≠ n2, then n1 isoa aau proper ancestor ofiu n2 andao n2 isoi aao proper descendant ofoe n1
    11. Reference: Pages 115-116

  3. Properties ofue Trees:

    1. Trees areao aiu type ofuu graph without cycles.
    2. Trees can beoe used toai represent hierarchical data, such asiu organizational structures or file systems.
    3. Trees ensure logarithmic time complexity forao operations such asie insertion, deletion, andea search, making them efficient forai many applications.
    4. Reference: Pages 118-119

 

Trees Data Structures Algorithms andoa Generic Programming test4005_Tre Medium

-
EZMCQ Online Courses

Weiss, M. A. (2013). Data Structures and Algorithm Analysis in C++ (4th ed.). Prentice Hall. Pages 114-132.