0
1. Binary Tree
2. Null Tree
3. High&Low Balance Tree
.
.
.
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
Difference types of nonlinear data structure?
Tree, Graphs are the types of nonlinear data structure.
What is the best data structure for notepad?
i think it will be tree...
What are primary data structure?
A primary data structure is a data structure that is created without the use of other data structures, whereas a secondary data structure relies on a primary data structure. A data structure is an organized collection of data elements.[NOTE: Be careful not to confuse the term data structure with the term data type. It is a common mistake. This answer addresses dat structures. Often people who ask about primary data structures or primitive data structures are really asking about primitve data types.]Here is an example where an array is a primary data structure and a binary tree is a secondary data structure based on the array:An array is a primary data structure -- it is a set of sequentially numbered data elements, such as an array of integers or an array of names -- name0, name, name2, ...A binary tree is a data structure where each element (called a node) has a data component and pointers to it's left and right sub-trees. [Think of a directory of folders, but each folder can only have two sub-folders.] We can create an and store an array of nodes to set up the tree in languages like C++ or Java.The root of the tree could be node 1 in the array, it would point to nodes 2 and 3. node 2 would point to nodes 4 and 5, while node 3 would point to nodes 6 and 7 .. and so on. generally node n point to nodes 2n and 2n+1. (You can start with node 0, but the math is a little easier if you start with node 1.)The binary tree in this case is the secondary data structure, while the undelying array is the primary data structure.
Who invented data structures?
Data structure is a very basic concept. I don't think it's possible to trace it back to a single person who invented it...
What data structure is used to represent graphs in c language?
A tree.
Difference types of nonlinear data structure?
Tree, Graphs are the types of nonlinear data structure.
Which data structure represent many to many relationship?
tree
What is the difference between binary tree and tree data structure?
binary tree is a specific tree data structure where each node can have at most 2 children nodes. In a general Tree data structure nodes can have infinite children nodes.
Which can be used to represent a many to many relation with abstract data types?
tree
What is a suffix tree?
A Suffix Tree is a data-structure that allows many problems on strings (sequences of characters) to be solved quickly
What do you call a tree without node in data structure?
A null tree.
How many kinds of search in data structure?
array, file, record, table, the tree and so on
What is the best data structure for notepad?
i think it will be tree...
Define tree in data structure?
Tree is directed, cycle-less, connected graph.
What is non linear data strcuture?
A tree is an example for a non-linear data structure.
What are primary data structure?
A primary data structure is a data structure that is created without the use of other data structures, whereas a secondary data structure relies on a primary data structure. A data structure is an organized collection of data elements.[NOTE: Be careful not to confuse the term data structure with the term data type. It is a common mistake. This answer addresses dat structures. Often people who ask about primary data structures or primitive data structures are really asking about primitve data types.]Here is an example where an array is a primary data structure and a binary tree is a secondary data structure based on the array:An array is a primary data structure -- it is a set of sequentially numbered data elements, such as an array of integers or an array of names -- name0, name, name2, ...A binary tree is a data structure where each element (called a node) has a data component and pointers to it's left and right sub-trees. [Think of a directory of folders, but each folder can only have two sub-folders.] We can create an and store an array of nodes to set up the tree in languages like C++ or Java.The root of the tree could be node 1 in the array, it would point to nodes 2 and 3. node 2 would point to nodes 4 and 5, while node 3 would point to nodes 6 and 7 .. and so on. generally node n point to nodes 2n and 2n+1. (You can start with node 0, but the math is a little easier if you start with node 1.)The binary tree in this case is the secondary data structure, while the undelying array is the primary data structure.
What is the difference between primitive and non primitive data structure?
A primitive data structure is generally a basic structure that is usually built into the language, such as an integer, an array or a linked-list.A non-primitive data structure is built out of primitive data structures linked together in meaningful ways, such as a binary search tree, AVL Tree, Hashtable, etc.
