DEV Community: ahseya03

🎨 Primitive Data Types are like Primary Colors for creating Non-Primitive Data Types 🎨

ahseya03 — Wed, 21 Dec 2022 00:02:56 +0000

"When you mix any of the primary colors: red, yellow, blue. it results in a secondary color. Similarly, when you mix Primitive Data type, it results in a Non-Primitive Data type."- Ayesha Mahmood

Example:
An example of a primitive data type is "char". A char is a C++ data type used for the storage of a single letter. For eg. we have the char "H" as the primitive data type. So when we mix and combine the primary primitive data type i.e. char "H" with other letters like "e", "l", "l, "o". It results in a string "hello" which is a Non-Primitive data type. Hence we see that we can similarly in this manner mix other primitive data types to create secondary Non- Primitive Data Types.

Previous Post: Importance of Data Structure in Computer Science

Data Structure & Why It Is So Important? 👩‍💻👨‍💻

ahseya03 ・ Dec 16 ・ 2 min read

#computerscience #beginners

🌲 🌳 Binary Search Tree 🌲🌳

ahseya03 — Fri, 16 Dec 2022 15:47:49 +0000

Why do we need Binary Search trees?

Binary Search Trees are effective solutions to any real word problems and they are optimum solutions due to speed and accuracy.
Binary Search Tree is O (log n) average case.
Binary Search Tree is like a branch-like format, the algorithm knows where to search for the elements.
There are fewer comparisons done to find key-value pairs.
It is O (log n).
It supports operations like search inserts and deletes. For example, if you are trying to design an account class you may have the account number for the clients stored in a Binary Search Tree, and through this system it can support operations like inserting that is opening an account, searching for an account, or deleting an account.

Properties of Binary Search Tree:

There is the main node or top-level node: It has a left and right subtree.
Left value Subtree has values less than node.
Right Side Subtree has values greater than the node.

Binary Search Tree Searching: (PseudoCode)
1- Check if the Binary Search Tree is empty, if yes print a not found message, meaning it is not there.
2- If it is not empty, compare the key with the given value.
3- If root equals given value, then print key found.
4- It is not equal to the given value check where to search

if given value < root key search left subtree, then start from step 1 again till you find it.
- If the given value is > root key, search the right subtree then start from step 1 again till you find it.

*Binary Search Insertion *
1- Check if the Binary Search Tree is empty if yes insert the node.
2- If it is not empty compare the root with the given value
3- If root key < given value go to the right subtree to find a position to insert the new node.
4- If root key > given value go to the left subtree to find a position to insert the new node.

Binary Search Removal:
There are 3 cases to remove:

- Empty Tree:
You can't do anything since there is nothing to remove.

Do Nothing

- Root Node
Find the Smallest item on left and delete the root node and replace it with the smallest item on left

             10                              11
           /     \         delete(10)      /     \
          7       15       --------->    7        15 
         /  \    /  \                   /  \        \ 
        5    8  11   18                5    8        18

- All Other Case is divided into 3 types:

Deleting Leaf Node that has no children : Simply delete the leaf node without any issues.


             10                             10
           /     \         delete(5)      /     \
          7       15       --------->    7       15 
         /  \    /  \                     \     /  \ 
        5    8  11   18                    8   11   18

Deleting Node that has one child: Delete the node and replace deleted node with its child.

             10                              10
           /     \         delete(15)      /     \
          7       15       --------->    7       11 
         /  \    /                      /  \      
        5    8  11                     5    8

Deleting Node that has 2 children Either go to the right tree and find the smallest value/ go to the left tree and find the biggest value to push it up in the node.

             10                             10
           /     \         delete(15)      /     \
          7       15       --------->    7       11 
         /  \    /  \                   / \        \ 
        5    8  11   18                5   8      18

Pre Order Traversal

In Order Traversal

Post Order Traversal

Data Structure & Why It Is So Important? 👩‍💻👨‍💻

ahseya03 — Fri, 16 Dec 2022 06:03:54 +0000

"To build a house, you need a structure. When you choose the right structure for your house, your design aligns perfectly. Similarly, Data structures are programming structures essential in building your best program." - Ayesha Mahmood

Data Structures are classified into two types:

Primitive Data Types
Non-Primitive Data Types

Learn More about Primitive & Non Primitive Data types **

Primitive Data Types are Primary Colors for creating Non Primitive Data Types

ahseya03 ・・ 1 min read

**Overview of Data Structure Types

Choose your Structure!

Why do we learn about Data Structure in Computer Science?

It's hard to understand how Data Structure plays a role in programming and confuses many students why they have to learn Data Structure in their first Computer Science class.

Data structures are actually an essential way one can store data in a particular way that makes it efficient for use.

When you are writing code there will be data you want to store and there will also be data from the user.

We need something to store that data. So how do we store that data? This is where data structure comes in handy and that is the function of data structure which is built for organizing, processing, retrieving, and storing data.

Here we defined type as "string name". We are essentially creating a container of string data type to store only strings. There will be data from the user's side. In this example, the user will enter their name(data) as a "string" data type and this name will be stored in the container for string we defined.
For example:

We are asking the user for input. We are asking the user to type or input their name by using "cin name" command. We are getting input from the user. When asked for a name, the user entered "Sarah". "Sarah" string data is entered by the user which is then stored in the string container. The data is then processed and retrieved back to the console as output "Hello Sarah."

DEV Community: ahseya03

🎨 Primitive Data Types are like Primary Colors for creating Non-Primitive Data Types 🎨

Data Structure & Why It Is So Important? 👩‍💻👨‍💻

ahseya03 ・ Dec 16 ・ 2 min read

🌲 🌳 Binary Search Tree 🌲🌳

Data Structure & Why It Is So Important? 👩‍💻👨‍💻

Primitive Data Types are Primary Colors for creating Non Primitive Data Types

ahseya03 ・ ・ 1 min read

ahseya03 ・・ 1 min read