Sign Up | Sign In
Ask Questions & Get Answers at ibibo sawaal
Refine By Date
Refine By Categories
Sort by: Recency | Relevancy

Results 1 - 15 of about 5668 sawaal for "trees"

what is binary tree?

well;A binary tree is made of nodes, where each node contains a "left" pointer, a "right" pointer, and a data element. The "root" pointer points to the topmost node in the tree. The left and right pointers recursively point to smaller "subtrees" on either side. A null pointer represents a binary tree with no elements -- the empty tree. The formal recursive

Posted in Computers & Technology by rocky singh at 11:35 PM on May 21, 2008
Tags binary, tree

What is the Bodhi Tree?

It;s sacred tree under which gautam budha got the enlightment or bodhisatva.This tree is in bodhigaya bihar....The Bodhi Tree "Tree of Awakening," also known as the Bo Tree in Bodhgaya is a direct descendent of the tree under which Siddharta Gautama is attained enlightenment.After 49 days of meditation, it was here that Siddharta Guatama became the Buddha, the "Enlightened OneThe Bodhi

Posted in Puja & Rituals by unmand singh at 7:32 AM on October 05, 2008
Tags bodhi, tree

How to do pipalsTREE pooja??

For doing pooja yourself see 2F below. For doing Sacred thread ceremony for pipal tree or doing marriage for pipal tree with a basil plant/neem tree/banyan tree, according to the cusdom at your place, contact the vedic pandits/prohits there.1 Ashvattha in Sanskrit, the peepal or pipal Ficus religious is a very large tree. Its bark is light grey, smooth and peels in patches. Its heart-shaped leaves have

Posted in Puja & Rituals by Sree Kutti at 4:57 PM on September 09, 2008

What is an AVL tree?

An AVL tree is a special type of binary tree that is always "partially" balanced. The criteria that is used to determine the "level" of "balanced-ness" is the difference between the heights of subtrees of a root in the tree. The "height" of tree is the "number of levels" in the tree. Or to be more formal, the height of a tree is defined as follows:1

Posted in Computers & Technology by chinni. at 9:22 PM on November 03, 2008
Tags avl, tree

Give reasons why it is necessary to override a feature in object oriented programming?

be inheritance. Once you inherit, you can then override data member of methods of the parent class. In C ":" is used to tell C compiler that you want to inherit something. For example "Class MangoTree : public Tree " means class MangoTree is inheriting class Tree.The keyword public adds the information that only the public members are inherited. Once class MangoTree inherits class Tree, all

Posted in Computers & Technology by Aryan Gusain at 8:51 PM on July 11, 2008

The Benefits of Tea Tree Oil

well,Grown in the islands of the south Pacific and Australia, tea trees got their name because their bark, leaves, or twigs were historically used by settlers and travelers as a tea substitute. Australian tea trees, the main source of tea tree oil, are not trees at all, but rather green shrubs that grow in the wet coastal regions of Australia. These shrubs grow very quickly and can reach heights of 7

Posted in Personal Health by Kailash Negi at 8:47 PM on September 19, 2008
Tags benefits, tree

what is STP Spanning Tree Protocol

well shashi, The Spanning Tree Protocol is an OSI layer-2 protocol which ensures a loop free topology for any bridged LAN. It is based on an algorithm invented by Radia Perlman while working for Digital Equipment Corporation. Spanning tree allows a network design to include spare redundant links to provide automatic backup paths if an active link fails, without the danger of bridge loops

Posted in Computers & Technology by shashi verma at 9:27 PM on May 03, 2008

Anybody can help me for Jsf Dynamic tree , please, im using rich faces...

for the Tree and Split Container components of DOJO. The HTML generated by JSF components is always parsed by the browser and is not output as a text by the Portal. The following portion of XHTML file shows how the custom JSF compoenent was used to generate the DOJOs tree and tabbed pane widgets.the tree should be even driven. Thus the requirement comes down to1 Server side toggling - only the expanded node should

Posted in Computers & Technology by some one at 9:14 PM on June 05, 2008

How to do pipalsTREE pooja??

...] PLEASE GIVE THE answer my question first :" How siidhartha become MAHATA BUDDHA a GOD realizez higher SOUL ? Whether & How he [Buddha...] performed THE PEEPAL TREE PUJA FOR INLITENMENT ?[2...] HOWEVER,There is no evidences as such that BUDDHA GET INLIGHTENMENT BY WORSHIPINGPEEPAL TREE WITH RITUALS.[3...] Term "ASHWASHTHA" used in the BHAGAVAD GITA [ B.G.15/1-4...]is reffered to as ETERNAL

Posted in Puja & Rituals by Sree Kutti at 4:56 PM on September 09, 2008

. In a tertiary tree, which has three childs for every node, if the number of internal nodes are N, then the total number of leaf nodes are there?

Most likely not if what youre used to are binary search trees. The strict ordering of less than/greater than is what makes binary search trees work, and modifying that to work with three way paths typically results in a multiway tree of order 3 rather than a true tertiary tree. The first thing you need to do is figure out how to order the data so that a simple insertion algorithm can be written

Posted in Computers & Technology by Nawraj at 8:42 AM on June 26, 2008

What is a spanning Tree?

Spanning tree can refer to: Spanning tree mathematics, a tree which contains every vertex of a more general graph Spanning tree protocol, a protocol for finding spanning trees in bridged networks...In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some or perhaps all of the edges of G. Informally, a spanning tree of G is a

Posted in Computers & Technology by AmitSingh at 4:24 AM on November 06, 2008
Tags spanning, tree

What is binary tree?

A binary tree is a method of placing and locating files called records or keys in a database, especially when all the data is known to be in random access memory RAM. The algorithm finds data by repeatedly dividing the number of ultimately accessible records in half until only one remains.In a tree, records are stored in locations called leaves. This name derives from the fact that records always

Posted in Computers & Accessories by Ashish Kumar at 5:33 PM on October 23, 2008
Tags binary, tree

What is difference between B tree and B tree? Why a B tree is a better tree structure than a B tree for implementation of an indexed sequential file?

B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in time Olog n. Definition of B-tree:A B-tree of order m maximum number of children for each node is a tree which satisfies:1.Every node has at most m children.2.Every node except root has at least m2 children.3.The root has at least two children if it is not a leaf node.4.All

Posted in Multimedia by Anonymous at 11:07 PM on March 03, 2011

Can anyone explain Btree in data structures through C.

Go to the followng for complete binary tree codes in c: http://www.dreamincode.net/for ums/showtopic10157.htmHi doctorluv, i hope beside above these books will help u in understanding data TreeB Trees are multi-way trees. That is each node contains a set of keys and pointers. A B Tree with four keys and five pointers represents the minimum size of a B Tree node. A B Tree contains only data

Posted in Computers & Technology by doctorluv at 11:05 PM on April 02, 2008

what is a binary tree?

A Binary tree is a non linear data structure in which in which each node is an object with three pointer fields represent by Left Child, Right Child and the Parent respectively .A binary tree either is empty no nodes, or has a root node, a left binary tree, and a right binary tree....In computer science, a binary tree is a tree data structure in which each node has at most two children. Typically

Posted in Computers & Technology by Kajal at 9:05 PM on December 20, 2007
Tags binary, tree
Section targeting
© 2006 - 2013 ibibo Web Pvt Ltd. All rights reserved.