Trees

# What is ordered tree in datastructure?

###### Wiki User

###### October 07, 2014 1:55AM

An ordered tree is a tree that has the children of each node ordered in a certain manner. When the root is shown at top, the children are written from left to right.

## Related Questions

###### Asked in Operating Systems

### How is multiprogramming achieved by an operating system?

When the timeslot for the current program runs out, the routine
saves the current CPU context into a datastructure, selects a new
program to be run for the next timeslot, and loads the CPU
registers with the values that were saved in that process's
datastructure. Hence a new program gets the CPU. This cycle
continues till all programs are terminated or aborted.

###### Asked in Computer Programming, Database Programming

### Explainthe different between B tree and B plus tree?

The B-tree is the classic disk-based data structure for
indexing records based on an ordered key set. The B+-tree
(sometimes written B+-tree, B+tree, or just B-tree) is a variant of
the original B-tree in which all records are stored in the leaves
and all leaves are linked sequentially. The B+-tree is used as a
(dynamic) indexing method in relational database management
systems.

###### Asked in Trees

### What is a multiway serach tree?

Multiway search tree of degree n. A generalization
of a binary search tree to a tree of degree n where each
node in the ordered tree has m ← n children and
contains (m-1) ordered key values, called subkeys. For some
given search key, if the key is less than the first subkey then the
first subtree (if it exists) is searched for the key; if the key
lies between the i th and (i + 1)th subkey,
wherei = 1,2,…, m-2
then the (i + 1)th subtree (if it exists) is searched; if
the key is greater than the last subkey then the m th
subtree (if it exists) is searched.

###### Asked in Past Tenses

### Will be ordered past tense?

###### Asked in C Programming

### What is the most appropriate datastructure to implement priority queue?

The key characteristic of a priority queue is that elements in
the queue must be ordered in some way, such that elements with
higher priority move to the front of the queue more quickly than
those with lower priority. As such, the most appropriate data
structure for a priority queue is a heap, yielding O(1) extraction
time and O(log n) insertion time.

###### Asked in Alternative Treatments for Conditions or Diseases

### What is a good Substitute for tea tree oil?

Manuka oil is also from Australia and is more powerful and
gentler on the skin than tea tree oil. It can be ordered online and
used the same way as tea tree oil.
The active ingredient in tea tree oil can also be found in
medicinal Thai ginger called plai. It is available outside of
Thailand as an essential oil.

###### Asked in Computer Programming, Database Programming, C Programming

### What is the difference between extended binary tree and a binary search tree?

Binary search trees form an important sub class of binary trees.
In an ordinary tree, the elements are not ordered in any way. A
binary search tree is a binary tree which is either empty or in
which the following criteria are satisfied.
1. All keys of the
left sub tree of the root are less than the root.
2. All keys of the
right sub tree of the root are greater than the root.
3. The left and
right sub tree of a binary search tree are binary search trees on
once again.
Extended binary tree:
---
In an extended binary tree, the special nodes are added to a
binary tree to make it complete binary tree. In extended binary
tree each node must contain two child.