Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 402c545

Browse files
refactor
1 parent a3a520c commit 402c545

File tree

1 file changed

+9
-5
lines changed

1 file changed

+9
-5
lines changed
Lines changed: 9 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,20 @@
1+
# Points:
12
interviews are to see the power of person in problem solving .
3+
24
data structures are used in problem solving.
5+
36
data structures is a way to organize and mange data.
7+
48
a data structure is a collection of data values, the relationships among them and the operations the can be applied to the data.
59
Complexity is fundamental to understand data structures.
610

7-
remember, when you think about data structure vs adt, we just think about container not operations, ot all operations,
8-
for example the main feature of array is random access so binary search and the main feature of linked list is easy add and delete an node so operations like first delete or last delete are good, or BST binary search and easy add and delete nodes.
11+
Remember, when you think about data structure vs adt, we just think about container not operations, or all operations,
12+
for example the main feature of array is random access so binary search and the main feature of linked list is easy add and delete a node so operations like first delete or last delete are good, or BST binary search and easy add and delete nodes.
913
GeneralTree is used for decision tree
1014

11-
Types of Binary Trees:
15+
## Types of Binary Trees:
1216
Full Binary Tree: A full binary tree is a binary tree where every node has exactly 0 or 2 children.
13-
Perfect Binary Tree: A binary tree is perfect binary Tree if all internal nodes have two children and all leaves are at the same level.
1417
Complete Binary Tree: A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
18+
Perfect Binary Tree: A binary tree is perfect binary Tree if all internal nodes have two children and all leaves are at the same level.
1519

16-
in Tree, in each level the size become double
20+
in Tree, in each level the size become double

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /