ROOTED TREE
1. NORKAMALIAH FAQIHAH BINTI AZMAN (298516)
1. INTRODUCTION
In discrete mathematics, a rooted tree is a tree data
structure where one vertex is distinguished as the "root." This
root serves as the starting point for traversing the tree, and
every other vertex is connected by edges, forming branches
and subbranches. The relationship between vertices in a
rooted tree is hierarchical, with the root at the top and
descendants below. Rooted tree can be present as data
structure.
2. PROBLEM - How manager find
employees.
BC Company needs marketing staff. they has to collect and
check information from candidates, following legal and
ethical standards. they also has to assess their data
structure. How can they find employees from the data
structure by applying rooted tree?
4.0 RESULTS & FINDINGS
1. Identify the categories of the applicant .
Name, contact info, high school and appication data
2. Gather information for each category.
Name: first, middle initial and last
Contact info: address(including street, city, state and
postal code), email and phone (home phone and cell
phone)
Highschool
Applications data: major, application paid, SAT (math and verbal)
and recommendations (1,2and 3)
3. Create nodes for each element
4. Connect the nodes.
5. Organize hierarchically.
Place the main categories at a higher level and connect them to
subcategories or individual elements using lines for each element.
Group Members
2. AMIERUDDIN AFIQ BIN ABD RANI (300989)
3. DAHIYAH NAJWA BINTI SALI (298567)
Level 0
Level 1
Level 2
1. A is a root.
2. B-parent of D & E/C-parent of F & G/A-parent of B & C
3. A is an ancestor of B, C, D, E, F & G.
4. B, C, D, E, F & G is a descendants of A
5. D & E are sibling/ F & G are sibling NOTE
6. B & C are internal node height - length of
7. D, E, F and G are leaf largest path below
root to any leaf
3. OBJECTIVES TO BE ACHIEVED
1. Integrate the rooted tree into relevant
applications or systems, ensuring seamless
interaction and utilization in practical scenarios.
2. To compile all the data of applicant in easy way.
3. To optimize the solution by reducing the space
and time complexity of the algorithm.
5.0 CONCLUSION
In conclusion, the applications of trees in data structures are
far-reaching and impact multiple facets of computer science
and beyond. Trees provide elegant solutions to intricate
problems, offering efficient data organization, optimized
searching, and hierarchical representation. From databases
and file systems to artificial intelligence algorithms and
network routing, trees play a vital role in enhancing
performance and enabling effective data management. The
techniques offered tackle important goals of the
incorporation of a rooted tree into applications, gathering
candidate information, and enhancing algorithmic
effectiveness. A smooth interaction and useful application
are guaranteed by the rooted tree's integration into pertinent
systems through the use of a modular and well-documented
strategy.