Skip to main content

Application of trees

 Some Applications of Trees:

  1. Trees implement hierarchical structures in computer systems like directories and file systems.
  2. Trees are also used to implement the navigation structure of a website.
  3. We can generate code like Huffman's code using Trees.
  4. Trees are also helpful in decision-making in Gaming applications.
  5. Trees are responsible for implementing priority queues for priority-based OS scheduling functions.
  6. Trees are also responsible for parsing expressions and statements in the compilers of different programming languages.
  7. We can use Trees to store data keys for indexing for Database Management System (DBMS).
  8. Spanning Trees allows us to route decisions in Computer and Communications Networks.
  9. Trees are also used in the path-finding algorithm implemented in Artificial Intelligence (AI), Robotics, and Video Games Applications.

Comments

Post a Comment

Popular posts from this blog

7 features of OOPs

The 7 features of OOPs are as follows: 1. Incapsulation 2. Abstraction 3. Inheritance 4. Polymorphism 5. Object must be used 6. Massage passing : One object can interect with another object 7. Dynamic binding The most initial 4 are the basic OOPs features that is required.
Post a Comment
Read more

Sieve Erotosthenes program in c++

  #include <bits/stdc++.h> using namespace std ; /* this program is for finding the prime number till the given number */ void primeSieve ( long long n ) {     long long prime [ n + 1 ] = { 0 };     for ( long long i = 2 ; i <= n ; i ++ )     {         if ( prime [ i ] == 0 )         for ( long long j = i * i ; j <= n ; j += i )         {             prime [ j ] = 1 ;         }             }     for ( long long i = 2 ; i <= n ; i ++ )     {         if ( prime [ i ] == 0 )         cout << i << " " ;     }         } int main () {     long long n ;     cin >> n ;     primeSieve ( n );     return 0 ; }
2 comments
Read more

Array Data Structure

1 comment
Read more