New updates

Updated ProfileDate:2019-12-06 14:19:15Done by:andicea35Searching for :Shell+scriptDate:2019-12-06 14:15:03Done by:Anonymous user(Visitor)

Searching for :Node+JsDate:2019-12-06 14:15:03Done by:Anonymous user(Visitor)

Career 2.0

You might be intrested on below oppertunities Show me All

### Similar Questions

**T he postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is ______.**

1 Answer

**The inorder and preorder traversal of a binary tree are d b e a f c g and a b dec f g, respectively. -computer science-gate-2007**

1 Answer

**The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree? -gate-computer science-2013**

1 Answer

**How to perform an In order traversal in given binary tree?**

1 Answer

**We are given a set of n distinct elements and an unlabeled binary tree with n nodes. -gate-cse-2011**

1 Answer

**Consider the pseudocode given below. The function Dosomething () takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. - Gate Computer Sci**

1 Answer

**Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal, respectively, of a complete binary tree. GATE CSE 2000**

1 Answer

**A forester, pictured below, is trying to measure the height of a tree. Her height is x =1.5 m. She stands y = 10 m away from a tree, from where the angle subtended to the top of the tree is z = 45°. The height of the tree is _______ m (round off to 1 decimal place).**

0 Answer

**Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?**

0 Answer

**Consider the following rooted tree with the vertex labelled P as the root: (-Gate Computer Science 2014)**

1 Answer

**Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0. -gate computer science 2017**

1 Answer

**Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at random. The expected value of the distance between a and b in T (i.e., the number of edges in the unique path between a and b) is (rounded off to 2 decimal places)**

1 Answer

**Consider the following statements:**

0 Answer

**What is the difference between binary search tree and binary tree?**

1 Answer

**Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree GATE CSE 2000**

1 Answer

**How to Print all leaves of a binary search tree?**

1 Answer

**The value is going blank after submition**

1 Answer

**Implement an unbalanced binary search tree.**

0 Answer

**Explain in detail the DOM tree traversal and modification.**

1 Answer

**Implement a balanced binary search tree of your choice. I like (a,b)-trees best.**

0 Answer

### Notes

**Data structure with C 10CS35 unit-5**

**Data structure with C 10CS35 unit-8**

**3 of Fire: Experiencing**

**9 of Rainbows: Ripeness**

**FILE STRUCTURES 10IS63**

**Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-6**

**COMPAILER DESIGN 10CS63 VTU NOTES UNIT-5**

**5 of Clouds: Comparison**

**Data structure with C 10CS35 unit-7**

**Data StructuresDS 10CS35**

## View question

## T he postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is ______.

Gate Computer ScienceAsked On2019-04-10 15:24:50 by:Rohit498

Taged users:

Likes:

Be first to like this question

Dislikes:

Be first to dislike this question

## Comments