# The appearance of prisoners is very minimal. How much time do you spend in makeup and wardrobe before filming, and what is that process like?

View Full Interview# Difference between data type and data structure?

Data type can be regarded as data structure because we can define our own data type by using typed function. Data types are the category in which the variable are listed to ho…ld the specific value and data structures are the way in which the values and variables are stored in the memory. The use of a data type called structures allows a collection of values possibly of different types to be treated as a single item. Each data structure is built up from the basic data types of the underlying programming language using the available data structuring facilities, such as arrays & pointers

# DIFFERENCE between GRAPH and TREE IN DATA STRUCTURES?

A tree is a specialized case of a graph. A tree is a connected graph with no circuits and no self loops. A graph consists of 3 sets - vertices, edges and a set representing r…elations between vertices and edges i.e. v = (a, b, c) e = (e1, e2, e3) and x = ((a,b,e1), (b,c,e2), (a,c,e3)) represents a graph where e1 joins a and b and so on. A circuit is alternating sequence of edges and vertices where in edges are not repeated, vertices may be and starting and ending vertices are the same e.g. a e1 b e2 c e3 a means a connected to b, b to c and c to a. This forms a loop. A self loop is a vertex looping on to itself. As a tree does not contain any loops and is still connected, it is also called a minimally connected graph i.e. there is just one path between any 2 vertices.

# What is a balanced tree in data structures?

A balanced tree is a tree which is balanced - it has roughly the same height on each of its sub-nodes. A balanced tree will have the lowest possible overall height. For… example, a balanced binary search tree will have equal heights (plus or minus one) on the left and right sub-trees of each node. This ensures that operations on the tree always are guaranteed to have O(lg n) time, rather than the O(n) time that they might have in an unbalanced tree. Certain tree algorithms are designed for ensuring that the tree stays balanced at all times, while maintaining the O(lg n) time for all operations. Such algorithms, such as red-black trees, AVL trees, and others, are generally used in standard library implementation of binary search trees.

# What is tree abstract data type?

It is my opinion that you're just looking at a tree structure for data; calling it asbstract just means you're not looking at a concrete implementation - rather the idea… of tree data structuring. There are a couple of links below to get you started http://en.wikipedia.org/wiki/Tree_(computer_science) http://www.sqa.org.uk/e-learning/LinkedDS04CD/index.htm WRT it being a data type, it depends on the language. Some have Tree Types in the language, C# for example, some require you to build your own. I hope this helps - if not I'm sure someone much wiser than I will come along...

# 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.

# What is unbalanced tree in data structures?

what is unbalanced trees

# Applications of trees in data structures?

For efficient storage of information the trees are used.

# Data structures - types of queue?

1.linear queue 2.circular queue 3.double ended queue

# Type of data structure for storing data?

It depends on what kind of data. If you want to store integer numbers use short, int, long. If you have numbers with decimal point use float, and double. If you want to …store characters use char. And in case if you want to store text use char* or char mytext[], and of course string.

# Structure data type and elementary data type?

Both of them is very important in programming.

# What are the Application of tree and graph in data file structures?

trees and graphs are very important data structures. they are used in compilers and in data base. compiler uses tree structures do convert data types and do calculations on bo…oleans and variables. even the modem on your computer uses a binary tree structure called huffman encoding for data compression.

# What is general tree in data structure?

Binary tree is a tree where each node has one or two children.While in case of general tree, a node can have more than two children.A binary tree can be empty, whereas the gen…eral tree cannot be empty

# Avl tree explain with example in data structure?

refer the book datastructure of author pudumbekar technical publication

# Types of searching techniques in data structure?

linear and binary searching techniques

# What are the applications of trees in data structure?

find the minimum cost of the path to reach the desired node

# What is spanning tree in data structure?

spanning tree is a tree which is used to find optimum path of a given graph

# Why you need different type of data structure?

Just as a car is not the same as an airplane, nor is your name the same type of data as your age (a "string" versus a "number"), different types of data structures allow progr…ammers to model different types of data they wish to represent.